Abstract λ-Calculus Machines

DOI10.1007/978-3-540-88059-2_4zbMath1170.68498OpenAlexW2151669521MaRDI QIDQ3599179

Werner Kluge

Publication date: 3 February 2009

Published in: Central European Functional Programming School (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88059-2_4

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Abstract computing machines. A lambda calculus perspective.
• A compiled implementation of strong reduction
• π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• The Mechanical Evaluation of Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Abstract λ-Calculus Machines