New Developments in Environment Machines

DOI10.1016/j.entcs.2009.03.035zbMath1294.03020MaRDI QIDQ5170161

Nikolaos Siafakas, Maribel Fernández

Publication date: 22 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.03.035

zbMATH Keywords

linear logic; \(\lambda\)-calculus; explicit substitutions; environment machines

Mathematics Subject Classification ID

03B70: Logic in computer science

03F52: Proof-theoretic aspects of linear logic and other substructural logics

03B40: Combinatory logic and lambda calculus

Related Items

Unnamed Item, The Negligible and Yet Subtle Cost of Pattern Matching, The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus

Cites Work

• Linear logic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• An abstract framework for environment machines
• The categorical abstract machine
• Term rewriting for normalization by evaluation.
• Reversible, irreversible and optimal \(\lambda\)-machines
• Lambda-calculus with director strings
• Improving the lazy Krivine machine
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• A compiled implementation of strong reduction
• The Theory of Calculi with Explicit Substitutions Revisited
• Linear explicit substitutions
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• The Mechanical Evaluation of Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item