Paper: Reasoning with Continuations (at LICS 1986)

Authors: Matthias Felleisen Daniel P. Friedman Eugene E. Kohlbecker Bruce F. Duba

Abstract

The λ-calculus is extended with two operations and the corresponding axoims: C, which gives access to the current continuation, and A, which is an abort or stop operator. The extended system is a sound and consistent calculus. We prove a standardization theorem and adopt the standard reduction function as an operational semantics. Based on it, we study the access to and invocation of continuations in a purely syntactic setting. With the derived rules, programming with continuations becomes as easy as programming with functions.

BibTeX

  @InProceedings{FelleisenFriedmanKo-ReasoningwithContin,
    author = 	 {Matthias Felleisen and Daniel P. Friedman and Eugene E. Kohlbecker and Bruce F. Duba},
    title = 	 {Reasoning with Continuations},
    booktitle =  {Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986)},
    year =	 {1986},
    month =	 {June}, 
    pages =      {131--141},
    location =   {Cambridge, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }