Reversible, irreversible and optimal \(\lambda\)-machines
From MaRDI portal
Publication:1575873
DOI10.1016/S0304-3975(99)00049-3zbMath0952.03008MaRDI QIDQ1575873
Laurent Regnier, Vincent Danos
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
linear logiclambda-calculusgeometry of interactioncall/return symmetryinteraction abstract machineKrivine's abstract machinelinear head reductionreversible computations
Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (21)
Reversibility in the higher-order \(\pi\)-calculus ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ On the dynamics of sharing graphs ⋮ An introduction to differential linear logic: proof-nets, models and antiderivatives ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ Light logics and optimal reduction: completeness and complexity ⋮ A correspondence between maximal abelian sub-algebras and linear logic fragments ⋮ A syntactic congruence for languages of birooted trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The graphical Krivine machine ⋮ Uniformity and the Taylor expansion of ordinary lambda-terms ⋮ Causal-consistent rollback in a tuple-based language ⋮ Musings around the geometry of interaction, and coherence ⋮ New Developments in Environment Machines ⋮ Evaluating lambda terms with traversals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Fresh Look at the λ-Calculus ⋮ A structural approach to reversible computation ⋮ A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine
This page was built for publication: Reversible, irreversible and optimal \(\lambda\)-machines
