An efficient interpreter for the lambda-calculus

DOI10.1016/0022-0000(81)90073-8zbMath0472.03012MaRDI QIDQ1158139

Gianfranco Prini, Luigia Carlucci Aiello

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90073-8

zbMATH Keywords

implementation; call-by-need reduction algorithm

Mathematics Subject Classification ID

03B40: Combinatory logic and lambda calculus

03-04: Software, source code, etc. for problems pertaining to mathematical logic and foundations

Related Items

Choices in representation and reduction strategies for lambda terms in intensional contexts, Complexity of the combinator reduction machine, A notation for lambda terms. A generalization of environments, Higher-order substitutions

Uses Software

• ML
• LCF
• MAGMA-Lisp

Cites Work

• Stack implementation of shallow binding in languages with mixed scoping
• Prolegomena to a theory of mechanized formal reasoning
• A partial evaluator, and its use as a programming tool
• A theory of type polymorphism in programming
• A Transformation System for Developing Recursive Programs
• Can programming be liberated from the von Neumann style?
• A CUCH-machine: The automatic treatment of bound variables
• A simple formulation for two-dimensional contact problems using a moving friction cone
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item