Logic in Computer Science (LICS 1997)

Paper: Continuation models are universal for lambda-mu-calculus (at LICS 1997)

Authors: Martin Hofmann Thomas Streicher

Abstract

We show that a certain simple call-by-name continuation semantics of Parigot's lambda-mu-calculus is complete. More precisely, for every lambda-mu-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of lambda-mu, which maps terms to functions sending abstract continuations to responses, is full and faithful. Thus, any lambda-mu-category in the sense of is isomorphic to a continuation model derived from a cartesian-closed category of continuations.

BibTeX

  @InProceedings{HofmannStreicher-Continuationmodelsa,
    author = 	 {Martin Hofmann and Thomas Streicher},
    title = 	 {Continuation models are universal for lambda-mu-calculus},
    booktitle =  {Proceedings of the Twelfth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1997},
    year =	 1997,
    editor =	 {Glynn Winskel},
    month =	 {June}, 
    pages =      {387--395},
    location =   {Warsaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }