δο!∈=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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimal reductions in interaction systems
• Title not available (Why is that?)
• Interaction Systems I: The theory of optimal reductions
• Title not available (Why is that?)

Cited In (4)

• Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations
• Coherence for sharing proof nets
• Title not available (Why is that?)
• Title not available (Why is that?)

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)