Reversible, Irreversible and Optimal Lambda-machines

There are two quite diierent possibilities for implementing linear head reduction in-calculus. Two ways which we are going to explain brieey 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.

[1]  Vincent Danos,et al.  Local and asynchronous beta-reduction , 1993, LICS 1993.

[2]  J. Girard.  Geometry of interaction III: accommodating the additives , 1995 .

[3]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[4]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[5]  Ian Craig Mackie.  The geometry of implementation , 1994 .

[6]  Y. Lafont.  From proof-nets to interaction nets , 1995 .

[7]  Martín Abadi,et al.  The geometry of optimal lambda reduction , 1992, POPL '92.

[8]  Laurent Regnier,et al.  Une équivalence sur les lambda-termes , 1994, Theor. Comput. Sci..

[9]  Vincent Danos,et al.  Game semantics and abstract machines , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[10]  Laurent Regnier,et al.  Lambda-calcul et reseaux , 1992 .

[11]  Jean-Yves Girard,et al.  Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.

[12]  C. Laneve,et al.  Paths in the lambda-calculus , 1994, LICS 1994.

[13]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..