Abstract

[Anybody taye in the first paragraph? Thanks!] The central result of this paper is an extension of the lambda(v)-C-calculus for a complete set of control operators and a correspondence theorem between the new theory and the lambda/beta/eta-calculus. Technically, the theorem shows that the two calculi prove the same equations with respect to the well-known continuation-passing style translation (and its inverse), which is the standard tool for defining control operators via translation into a functional language. As a corollary, the calculus proves all program equivalences between terms over the pure language extended with control operators. We believe that this work has important consequences for the direct-style compilation of programming languages with control operators.

Citations