A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine

DOI10.1016/J.ENTCS.2006.12.040MaRDI QIDQ2864217zbMATH OpenOpenAlexFDO

Authors Nikolaos Siafakas

Publication date 6 December 2013

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.2006.12.040

zbMATH Keywords

geometry of interactionlabelslambda calculuspaths

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Labelled calculi of resources
• Labelled \(\lambda\)-calculi with explicit copy and erase
• The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• scientific article; zbMATH DE number 1722666

Cites work

• Closed reduction: explicit substitutions without $\alpha$ -conversion
• scientific article; zbMATH DE number 2016068 (Why is no real title available?)
• Interaction nets for linear logic
• Interaction Systems I: The theory of optimal reductions
• Linear logic
• Paths, computations and labels in the \(\lambda\)-calculus
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Reversible, irreversible and optimal \(\lambda\)-machines
• The optimal implementation of functional programming languages

Cited in

(2)

• Labelled calculi of resources
• Labelled \(\lambda\)-calculi with explicit copy and erase

This page was built for publication: A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864217)