On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control

Abstract

We construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski. However, instead of relying on nested CPS translations, these operators are directly interpreted in linear logic extended with subexponentials (i.e., multiple pairs of ! and ?). We construct an independent proof theory for a fragment of this logic based on the principle of focusing. It is then shown that the new constraints placed on the permutation of cuts correspond to multiple levels of delimited control.
Fichier principal
Vignette du fichier
subdelimlncs.pdf (270.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01239753 , version 1 (08-12-2015)

Identifiers

Cite

Chuck Liang, Dale Miller. On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control. LPAR 20 - International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Suva, Fiji. pp.297-312, ⟨10.1007/978-3-662-48899-7_21⟩. ⟨hal-01239753⟩
333 View
121 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More