(Enter summary)
Abstract: Lamping discovered an optimal graph-reduction implementation of the -calculus. Simultaneously, Girard invented the geometry of interaction, a mathematical foundation for operational semantics. In this paper, we connect and explain the geometry of interaction and Lamping's graphs. The geometry of interaction provides a suitable semantic basis for explaining and improving Lamping's system. On the other hand, graphs similar to Lamping's provide a concrete representation of the geometry of... (Update)
Cited by: More
Rank Bounded Intersection: Types, Potency, and Idempotency - Neergaard, Mairson (2003)
(Correct)
Types, Potency, and Idempotency: Why Nonlinearity and.. - Neergaard, Mairson (2004)
(Correct)
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994)
(Correct)
Active bibliography (related documents): More All
0.5: An implementation model of the typed lambda-calculus based on.. - Sato, al. (2001)
(Correct)
0.3: Reversible, Irreversible and Optimal ...-machines - Danos, Regnier
(Correct)
0.3: Proof-nets and the Hilbert space - Danos, Regnier (1995)
(Correct)
Similar documents based on text: More All
0.3: Linear Logic for Meaning Assembly - Dalrymple, Lamping, Pereira.. (2002)
(Correct)
0.3: Interaction Systems I: The theory of optimal reductions - Asperti, Laneve (1994)
(Correct)
0.3: Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998)
(Correct)
Related documents from co-citation: More All
36: An algorithm for optimal lambda calculus reductions (context) - Lamping - 1990
36: Interaction Nets (context) - Lafont - 1990
31: Theoretical Computer Science (context) - Girard - 1987
BibTeX entry: (Update)
G. Gonthier, M. Abadi, and J.-J. L'evy. The geometry of optimal lambda reduction. In Proc. ACM Symposium Principles of Programming Languages, 1992. http://citeseer.ist.psu.edu/gonthier92geometry.html More
@inproceedings{ gonthier92geometry,
author = "Georges Gonthier and {Mart\'{\i}n} Abadi and Jean-Jacques {L\'evy}",
title = "The Geometry of Optimal Lambda Reduction",
booktitle = "Conference Record of the Nineteenth Annual {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
address = "Albequerque, New Mexico",
pages = "15--26",
year = "1992",
url = "citeseer.ist.psu.edu/gonthier92geometry.html" }
Citations (may not include all citations):
215
Theoretical Computer Science (context) - Girard - 1987
109
Interaction nets (context) - Lafont - 1990
42
On laziness and optimality in lambda interpreters: Tools for.. (context) - Field - 1990
24
An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
21
A new constructive logic: Classical logic (context) - Girard - 1991
21
Geometry of interaction I: Interpretation of system F (context) - Girard - 1989
20
Optimal interpreters for lambda-calculus based functional la.. (context) - Kathail - 1990
16
Semantics and pragmatics of the lambda calculus (context) - Wadsworth - 1971
10
Optimal reductions in the lambda-calculus (context) - L'evy - 1980
4
Geometry of interaction II: Deadlock-free algorithms (context) - Girard
2
Linear logic and parallelism (context) - Girard
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.digital.com/SRC/personal/Martin_Abadi/allpapers.html): More
Baby Modula-3 and a theory of objects - Abadi (1993)
(Correct)
A Logic for Parametric Polymorphism - Plotkin, Abadi (1993)
(Correct)
A TLA Solution to the RPC-Memory Specification Problem - Abadi, Lamport, Merz (1996)
(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