Factorization and normalization, essentially

DOI10.1007/978-3-030-34175-6_9MaRDI QIDQ6536313zbMATHFDO

Authors Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri

Publication date 19 April 2024

Mathematics Subject Classification ID

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

Recommendations

• An abstract factorization theorem for explicit substitutions
• Head reduction and normalization in a call-by-value lambda-calculus
• Axiomatic rewriting theory II: the   -calculus enjoys finite normalisation cones
• \(\lambda\)-calculi with explicit substitutions preserving strong normalization
• Parallel reductions in \(\lambda\)-calculus

Cites work

• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 1086711 (Why is no real title available?)
• scientific article; zbMATH DE number 6825409 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 6792365 (Why is no real title available?)
• (Leftmost-outermost) beta reduction is invariant, indeed
• A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus
• A semantic measure of the execution time in linear logic
• An abstract factorization theorem for explicit substitutions
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Head reduction and normalization in a call-by-value lambda-calculus
• Leftmost outermost revisited
• Light affine lambda calculus and polynomial time strong normalization
• On abstract normalisation beyond neededness
• On theories with a combinatorial definition of 'equivalence'
• Parallel reductions in \(\lambda\)-calculus
• Parametric parameter passing \(\lambda\)-calculus
• Random Descent
• Some lambda calculus and type theory formalized
• Standardization of a Call-By-Value Lambda-Calculus
• The Standardization Theorem for λ‐Calculus
• The conservation theorem for differential nets
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The parametric lambda calculus. A metamodel for computation.

Cited in

(2)

• Strategies for asymptotic normalization
• Light genericity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536313)