A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine

DOI10.1016/J.ENTCS.2006.12.040zbMath1277.03013OpenAlexW1975604664MaRDI QIDQ2864217

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

pathslambda calculusgeometry of interactionlabels

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Paths, computations and labels in the \(\lambda\)-calculus
• Reversible, irreversible and optimal \(\lambda\)-machines
• Interaction nets for linear logic
• Interaction Systems I: The theory of optimal reductions
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine