Factorization and normalization, essentially

DOI10.1007/978-3-030-34175-6_9zbMATH Open1542.68024MaRDI QIDQ6536313FDOQ6536313

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)

Cites Work

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

Cited In (1)

• 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)