Georges Gonthier
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 interaction. Together, they offer a new understanding of computation, as well as ideas for efficient and correct implementations.
- Fie90.John Field. On laziness and optimality in lambda interpreters: Tools for specification and analysis. In Seventeenth Annual A CM Symposium on Principles of Programming Languages, pages 1-15. ACM, January 1990. Google Scholar
Digital Library
- Gira.Jean-Yves Girard. Geometry of interaction II: Deadlock-free algorithms.Google Scholar
- Girb.Jean-Yves Girard. Linear logic and parallelism.Google Scholar
- Gir87.Jean-Yves Girard. Linear logic. Theoretical Compuler Science, 50:1-102, 1987. Google ScholarDigital Library
- Gir89.Jean-Yves Girard. Geometry of interaction I: interpretation of system F. In Ferro, Bonotto, Valentini, and Zanardo, editors, Logic Colloquium '88, pages 221-260. Elsevier Science Publishers B.V. (North Holland), 1989.Google Scholar
- Gir91.Jean-Yves Girard. A new constructive logic: Classical logic. Technical report, June 1991. INRIA Report 1443.Google Scholar
- Kat90.Vinod Kathail. Optimal interpreters for lambda-calculus based functional languages. PhD thesis, MIT, May 1990.Google Scholar
- Laf90.Yves Lafont. interaction nets. In Seventeenth Annual A CM Symposium on Principles of Programming Languages, pages 95- 108. ACM, January 1990. Google ScholarDigital Library
- Lam90.John Lamping. An algorithm for optimal lambda calculus reduction. In Seventeenth Annual A CM Symposium on Principles of Programming Languages, pages 16- 30. ACM, January 1990. Google ScholarDigital Library
- Lév80.Jean-Jacques L~vy. Optimal reductions in the lambda-calculus. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pages 159-191. Academic Press, 1980.Google Scholar
- Wad71.Christopher P. Wadsworth. Semantics and pragmatics of the lambda calculus. PhD thesis, Oxford, 1971.Google Scholar
Index Terms
- The geometry of optimal lambda reduction
Recommendations
Nested proof search as reduction in the Lambda-calculus
PPDP '11: Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programmingWe present a system for propositional implicative intuitionistic logic in the calculus of structures, which is a generalisation of the sequent calculus to the deep inference methodology. We show that it is sound and complete with respect to the usual ...
Light logics and optimal reduction: Completeness and complexity
Typing of lambda-terms in elementary and light affine logic (EAL and LAL, respectively) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, respectively) proof-nets admits a guaranteed polynomial (...
Mathematical Induction in Otter-Lambda
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates deduced clauses and uses strategies to control the deduction and retention ...
Comments