Home
Scholarly Works
A type-theoretic foundation of continuations and...
Conference

A type-theoretic foundation of continuations and prompts

Abstract

There is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters (prompts), the continuations become composable and the calculi are believed to become more expressive. We formalise that the addition of prompts corresponds to the addition of a single dynamically-scoped variable modelling the special top-level continuation. From a type perspective, the dynamically-scoped variable requires effect annotations. From a logic perspective, the effect annotations can be understood in a standard logic extended with the dual of implication, namely subtraction.

Authors

Ariola ZM; Herbelin H; Sabry A

Volume

39

Pagination

pp. 40-53

Publisher

Association for Computing Machinery (ACM)

Publication Date

September 19, 2004

DOI

10.1145/1016848.1016860

Conference proceedings

ACM SIGPLAN Notices

Issue

9

ISSN

0362-1340

Contact the Experts team