Abstract

We give a first-principles description of the context semantics of Gonthier, Abadi, and Levy, a computer-science analogue of Girard's geometry of interaction. We explain how this denotational semantics models λ-calculus, and more generally multiplicative-exponential linear logic (MELL), by explaining the call-by-name (CBN) coding of the λ-calculus, and proving the correctness of readback, where the normal form of a λ-term is recovered from its semantics. This analysis yields the correctness of Lamping's optimal reduction algorithm. We relate the context semantics to linear logic types and to ideas from game semantics, used to prove full abstraction theorems for PCF and other λ-calculus variants.

Citations

1225	The essence of functional programming - Wadler - 1992
174	On full abstraction for pcf - Hyland, Ong - 2000
173	Full abstraction for PCF - Abramsky, Jagadeesan, et al. - 2000
107	An algorithm for optimal lambda calculus reduction - Lamping - 1990
95	Rductions correctes et optimales dans le lambda-calcul. PhD thesis Paris 7 - Levy - 1978
93	The geometry of optimal lambda reduction - Gonthier, Abadi, et al. - 1992
91	Geometry of Interaction I: interpretation of system F - Girard - 1989
64	S.: The Optimal Implementation of Functional Programming Languages. Cambridge Tracts - Asperti, Guerrini - 1998
50	Linear logic without boxes - Gonthier, Abadi, et al. - 1992
44	Game semantics - Abramsky, McCusker - 1999
12	Parallel beta reduction is not elementary recursive - Asperti, Mairson
6	Linear logic, comonads and optimal reductions - Asperti - 1995
3	Paths, computations and labels in the λ-calculus - Asperti, Laneve - 1995