A substructural type system for delimited continuations

20Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear logic with hypothetical reasoning. Evaluation order is not only regulated by familiar focusing rules in the operational semantics, but also expressed by structural rules in the type system, so the types track control flow more closely. Binding and evaluation contexts are related, but the latter are linear. We use these ideas to build a type system for delimited continuations. It lets control operators change the answer type or act beyond the nearest dynamically-enclosing delimiter, yet needs no extra fields in judgments and arrow types to record answer types. The typing derivation of a directstyle program desugars it into continuation-passing style. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kiselyov, O., & Shan, C. C. (2007). A substructural type system for delimited continuations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4583 LNCS, pp. 223–239). Springer Verlag. https://doi.org/10.1007/978-3-540-73228-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free