See this document in CiteSeerX!

Reversible, Irreversible and Optimal ...-machines  (Make Corrections)  
Vincent Danos, Laurent Regnier



  Home/Search   Context   Related

 
View or download:
logique.jussieu.fr/pub...revirrev.ps.gz
iml.univmrs.fr/pub/re...revirrev.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  logique.jussieu.fr/www...DRpapers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. Keywords: -calculus, abstract machines, geometry of... (Update)

Active bibliography (related documents):   More   All
0.7:   Proof-nets and the Hilbert space - Danos, Regnier (1995)   (Correct)
0.3:   Directed Virtual Reductions - Vincent Danos (1997)   (Correct)
0.3:   Polarized Proof-Nets: Proof-Nets for LC (Extended Abstract) - Laurent   (Correct)

Similar documents based on text:   More   All
0.4:   Head Linear Reduction - Danos, Regnier (2004)   (Correct)
0.3:   Asynchronous games 1: Uniformity by group invariance - Mellies   (Correct)
0.1:   Polarisation Des Preuves Classiques Et Renversement - Quatrini, De Falco (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ danos-reversible,
  author = "Vincent Danos and Laurent Regnier",
  title = "Reversible, Irreversible and Optimal ...-machines",
  url = "citeseer.ist.psu.edu/249939.html" }
Citations (may not include all citations):
215   Theoretical Computer Science (context) - Girard - 1987
75   The geometry of optimal lambda reduction - Abadi, Gonthier et al. - 1992
72   Archive for Mathematical Logic (context) - Danos, Regnier et al. - 1989
35   Games semantics and abstract machines (context) - Danos, Herbelin et al. - 1996
33   From proof-nets to interaction nets - Lafont - 1995
22   Une 'equivalence sur les lambda-termes (context) - Regnier - 1994
21   Geometry of interaction I: an interpretation of system F (context) - Girard - 1988
16   Local and asynchronous betareduction (context) - Danos, Regnier - 1993
15   The geometry of implementation (context) - Mackie - 1995
10   ese de doctorat, Universit (context) - Regnier, R'eseaux - 1992
9   Paths in the lambda-calculus (context) - Asperti, Danos et al. - 1994
6   ese de doctorat, Universit (context) - Danos, de la et al. - 1990
4   Geometry of interaction III: acommodating the additives (context) - Girard - 1995
4   Geometry of interaction II: Deadlock free algorithms (context) - Girard - 1988
3   Quantifiers in linear logic II (context) - Girard - 1991

Documents on the same site (http://www.logique.jussieu.fr/www.danos/DRpapers.html):
Directed Virtual Reductions - Danos, Pedicini, Regnier (1996)   (Correct)
Timeless Games - Baillot, Danos, Ehrhard, Regnier (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC