Theoretical Computer Science
An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Paths, computations and labels in the &lgr;-calculus
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Parallel beta reduction is not elementary recursive
Information and Computation
Linear Logic, Comonads And Optimal Reductions
Fundamenta Informaticae
From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Tips on teaching types and functions
Proceedings of the 2008 international workshop on Functional and declarative programming in education
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Light logics and optimal reduction: Completeness and complexity
Information and Computation
Towards a geometry of recursion
Theoretical Computer Science
Functional programming in sublinear space
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Control-flow analysis of functional programs
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We give a first-principles description of the context semantics of Gonthier, Abadi, and L茅vy, 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.