Interaction Systems I: The theory of optimal reductions

DOI10.1017/S0960129500000566zbMath0871.03006OpenAlexW2160480844MaRDI QIDQ4327409

Andrea Asperti, Cosimo Laneve

Publication date: 6 April 1995

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500000566

zbMATH Keywords

lambda-calculuscombinatory reduction systemsinteraction netshigher-order rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Paths, computations and labels in the λ-calculus, δο!∈=1 Optimizing optimal λ-calculus implementations, Higher-order families, Interaction systems II: The practice of optimal reductions, Lambda calculus with explicit recursion, Developing developments, Coherence for sharing proof-nets, Skew confluence and the lambda calculus with letrec, A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine, Higher-order narrowing with definitional trees