Personal tools
You are here: Home 1998 A Computational Interpretation of the $\lambda\mu$-calculus

A Computational Interpretation of the $\lambda\mu$-calculus

G.M. Bierman (University of Cambridge) LFCS Theory Seminar Room 2509, JCMB, King's Buildings 3pm, Tuesday 10th February 1998

Recently Parigot introduced the $\lambda\mu$-calculus, which is a simple extension of the $\lambda$-calculus. The set of types of all closed $\lambda\mu$-terms enumerates all classical tautologies. In this talk I shall present a simple computational interpretation of this calculus. I shall demonstrate the richness of this interpretation by considering translations of various control operators. I shall show how one can present this interpretation as a simple transition system which leads to both a neat implementation and a simple but powerful operational theory.