Interaction systems II: The practice of optimal reductions

DOI10.1016/0304-3975(95)00062-3zbMath0873.03015OpenAlexW2035729130MaRDI QIDQ1350498

Cosimo Laneve, Andrea Asperti

Publication date: 27 February 1997

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

Full work available at URL: https://hal.inria.fr/inria-00074671/file/RR-2001.pdf

zbMATH Keywords

implementationlambda calculusinductive typescombinatory reduction systemsinteraction netshigher-order rewriting systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Coherence for sharing proof nets ⋮ Developing developments ⋮ Coherence for sharing proof-nets ⋮ Proof nets, garbage, and computations

Cites Work

• Interaction Systems I: The theory of optimal reductions
• Optimal reductions in interaction systems
• Paths, computations and labels in the λ-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interaction systems II: The practice of optimal reductions