The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus

DOI10.1007/978-3-662-52921-8_1zbMath1478.68083OpenAlexW2477365581MaRDI QIDQ2820681

Beniamino Accattoli

Publication date: 9 September 2016

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_1

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (6)

The Negligible and Yet Subtle Cost of Pattern Matching ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus ⋮ A Fresh Look at the λ-Calculus ⋮ (In)efficiency and reasonable cost models

Cites Work

• The weak lambda calculus as a reasonable machine
• Parallel beta reduction is not elementary recursive
• Improving the lazy Krivine machine
• Strongly reducing variants of the Krivine abstract machine
• On the correctness of the Krivine machine
• (Leftmost-Outermost) Beta Reduction is Invariant, Indeed
• Distilling abstract machines
• Local Bigraphs and Confluence: Two Conjectures
• A compiled implementation of strong reduction
• A Strong Distillery
• Deriving a lazy abstract machine
• On the Relative Usefulness of Fireballs
• New Developments in Environment Machines
• A nonstandard standardization theorem
• Logical Approaches to Computational Barriers
• Unnamed Item

This page was built for publication: The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus