Axiomatizing Subtyped Delimited Continuations

Materzok, Marek

doi:10.4230/LIPIcs.CSL.2013.521

Document

Axiomatizing Subtyped Delimited Continuations

Author Marek Materzok

Part of: Volume: Computer Science Logic 2013 (CSL 2013)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Computer Science Logic (CSL)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2013-09-02

PDF

File

PDF

LIPIcs.CSL.2013.521.pdf

Filesize: 0.53 MB
19 pages

Document Identifiers

DOI: 10.4230/LIPIcs.CSL.2013.521
URN: urn:nbn:de:0030-drops-42178

Subject Classification

Keywords

Delimited Continuations
Continuation Passing Style
Axiomatization

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get BibTex

Marek Materzok. Axiomatizing Subtyped Delimited Continuations. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 521-539, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.CSL.2013.521

Author Details

Marek Materzok

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail