Formalizing Implementation Strategies for First-Class Continuations

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review


    We present the first formalization of implementation strategies for first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) programs with a special treatment for the current continuation, accounting for the essence of first-class continuations. These abstract machines are proven equivalent to a standard, substitution-based abstract machine. The proof techniques work uniformly for various representations of continuations. As a byproduct, we also present a formal proof of the two folklore theorems that one continuation identifier is enough for second-class continuations and that second-class continuations are stackable.
    A large body of work exists on implementing continuations, but it is predominantly empirical and implementation-oriented. In contrast, our formalization abstracts the essence of first-class continuations and provides a uniform setting for specifying and formalizing their representation.
    Original languageEnglish
    Title of host publicationProgramming Languages and Systems : 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings
    EditorsGert Smolka
    Number of pages16
    Publication date2000
    Publication statusPublished - 2000
    Event9th European Symposium on Programming. ESOP 2000 - Berlin, Germany
    Duration: 25 Mar 2000 → …


    Conference9th European Symposium on Programming. ESOP 2000
    Period25/03/2000 → …
    SeriesLecture Notes in Computer Science


    Dive into the research topics of 'Formalizing Implementation Strategies for First-Class Continuations'. Together they form a unique fingerprint.

    Cite this