δο!∈=1 Optimizing optimal λ-calculus implementations

DOI10.1007/3-540-59200-8_51OpenAlexW50946012MaRDI QIDQ5055822FDOQ5055822

Authors Andrea Asperti

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59200-8_51

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations
• Reversible, irreversible and optimal \(\lambda\)-machines
• scientific article; zbMATH DE number 742718
• Optimal reductions in interaction systems
• Interaction systems II: The practice of optimal reductions

Cites work

• scientific article; zbMATH DE number 2185649 (Why is no real title available?)
• scientific article; zbMATH DE number 4179372 (Why is no real title available?)
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• Interaction Systems I: The theory of optimal reductions
• Optimal reductions in interaction systems

Cited in

(4)

• scientific article; zbMATH DE number 1418450 (Why is no real title available?)
• Coherence for sharing proof nets
• scientific article; zbMATH DE number 742718 (Why is no real title available?)
• Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations

This page was built for publication: δο!∈=1 Optimizing optimal λ-calculus implementations

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