Factorization and normalization, essentially

DOI10.1007/978-3-030-34175-6_9zbMath1542.68024MaRDI QIDQ6536313

Beniamino Accattoli, Giulio Guerrieri, Claudia Faggian

Publication date: 19 April 2024

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Light genericity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A semantic measure of the execution time in linear logic
• On abstract normalisation beyond neededness
• The parametric lambda calculus. A metamodel for computation.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Light affine lambda calculus and polynomial time strong normalization
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus
• Parametric parameter passing \(\lambda\)-calculus
• Some lambda calculus and type theory formalized
• On theories with a combinatorial definition of 'equivalence'
• (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
• The Standardization Theorem for λ‐Calculus
• Head reduction and normalization in a call-by-value lambda-calculus
• Standardization of a Call-By-Value Lambda-Calculus
• The conservation theorem for differential nets
• Random Descent
• Parallel reductions in \(\lambda\)-calculus

This page was built for publication: Factorization and normalization, essentially