License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2013.521
URN: urn:nbn:de:0030-drops-42178
Go to the corresponding LIPIcs Volume Portal

Materzok, Marek

Axiomatizing Subtyped Delimited Continuations

37.pdf (0.5 MB)


We present direct equational axiomatizations of the call-by-value lambda calculus with the control operators shift_0 and reset_0 that generalize Danvy and Filinski's shift and reset in that they allow for abstracting control beyond the top-most delimited continuation. We address an untyped version of the calculus as well as a typed version with effect subtyping. For each of the calculi we present a set of axioms that we prove sound and complete with respect to the corresponding CPS translation.

BibTeX - Entry

  author =	{Marek Materzok},
  title =	{{Axiomatizing Subtyped Delimited Continuations}},
  booktitle =	{Computer Science Logic 2013 (CSL 2013)},
  pages =	{521--539},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-60-6},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{23},
  editor =	{Simona Ronchi Della Rocca},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-42178},
  doi =		{10.4230/LIPIcs.CSL.2013.521},
  annote =	{Keywords: Delimited Continuations, Continuation Passing Style, Axiomatization}

Keywords: Delimited Continuations, Continuation Passing Style, Axiomatization
Collection: Computer Science Logic 2013 (CSL 2013)
Issue Date: 2013
Date of publication: 02.09.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI