Abstract

This paper proposes a simple computational interpretation of Parigot's -calculus. The -calculus is an extension of the typed -calculus which corresponds via the CurryHoward correspondence to classical logic. Whereas other work has given computational interpretations by translating the -calculus into other calculi, I wish to propose here that the -calculus itself has a simple computational interpretation: it is a typed - calculus which is able to save and restore the runtime environment. This interpretation is best given as a single-step semantics which, in particular, leads to a relatively simple, but powerful, operational theory.

Citations

270	Λµ-calculus: an algorithmic interpretation of classical natural deduction - Parigot - 1992
218	The lazy lambda calculus - Abramsky - 1990
153	Revised report on the algorithmic language Scheme - Clinger, Rees - 1991
122	The theory and practice of first-class prompts - Felleisen - 1988
109	Bisimilarity as a theory of functional programming - Gordon
73	Operationally-based theories of program equivalence - Pitts - 1997
67	A Curry-Howard foundation for functional computation with control - Ong, Stewart - 1992
55	An abstract framework for environment machines - Curien - 1991
54	A generalization of exceptions and control in ML-like languages - Gunter, Rémy, et al. - 1995
47	Fully abstract semantics for observably sequential languages - Cartwright, Curien, et al. - 1994
37	An interpretation of Standard ML in type theory - Harper, Stone - 1997
26	A simple calculus of exception handling - DeGroote - 1995
9	A Computational Interpretation of the -calculus - Bierman - 1998
8	On the relation between the -calculus and the syntactic theory of control - Groote - 1994
4	A classical linear -calculus - BIERMAN - 1996
4	A formulae-as-types notion of control. POPL’90 - Griffin
3	Operational semantics for program equivalence. Slides from talk given at MFPS - Pitts - 1997
2	Continuation models are universal for -calculus. LICS - HOFMANN, STREICHER - 1997