Affordable Access

Publisher Website

Reversible, Irreversible and Optimal λ-machines:Extended abstract

Authors
Journal
Electronic Notes in Theoretical Computer Science
1571-0661
Publisher
Elsevier
Publication Date
Volume
3
Identifiers
DOI: 10.1016/s1571-0661(05)80402-5
Keywords
  • λ-Calculus
  • Abstract Machines
  • Geometry Of Interaction
  • Reversible Computations

Abstract

Abstract There are two quite different possibilities for implementing linear head reduction in λ-calculus. Two ways which we are going to explain briefly 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 two ways, which we term reversible and irreversible, namely that the latter may be obtained as a natural optimization of the former.

There are no comments yet on this publication. Be the first to share your thoughts.