𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reversible, irreversible and optimal λ-machines

✍ Scribed by Vincent Danos; Laurent Regnier

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
163 KB
Volume
227
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

Lambda-calculus is the core of functional programming, and many di erent ways to evaluate lambda-terms have been considered. One of the nicest, from the theoretical point of view, is head linear reduction.

We compare two ways of implementing that speciÿc evaluation strategy: "Krivine's abstract machine" and the "interaction abstract machine". Runs on those machines stand in a relation which can be accurately described using the call/return symmetry discovered by Asperti and Laneve.

📜 SIMILAR VOLUMES

Reversible, Irreversible and Optimal λ-m
Reversible, Irreversible and Optimal λ-machines: Extended abstract
✍ Vincent Danos; Laurent Regnier 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 941 KB

There are two quite di erent possibilities for implementing linear head reduction in -calculus. Two w ays which w e are going to explain brie y here in the introduction and in details in the body of the paper. The paper itself is concerned with showing an unexpectedly simple relation between these t