Results 1 
8 of
8
Relational parametricity and control
 Logical Methods in Computer Science
"... www.lmcsonline.org ..."
(Show Context)
Linearlyused continuations in an enriched effect calculus
 In preparation
, 2009
"... Abstract. The enriched effect calculus is an extension of Moggi’s computational metalanguage with a selection of primitives from linear logic. In this paper, we present an extended case study within the enriched effect calculus: the linear usage of continuations. We show that established callbyval ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
Abstract. The enriched effect calculus is an extension of Moggi’s computational metalanguage with a selection of primitives from linear logic. In this paper, we present an extended case study within the enriched effect calculus: the linear usage of continuations. We show that established callbyvalue and callby name linearlyused CPS translations are uniformly captured by a single generic translation of the enriched effect calculus into itself. As a main syntactic theorem, we prove that the generic translation is involutive up to isomorphism. As corollaries, we obtain full completeness results for the original callbyvalue and callbyname translations. The main syntactic theorem is proved using a categorytheoretic semantics for the enriched effect calculus. We show that models are closed under a natural dual model construction. The canonical linearlyused CPS translation then arises as the unique (up to isomorphism) map from the syntactic initial model to its own dual. This map is an equivalence of models. Thus the initial model is selfdual. 1
A terminating and confluent linear lambda calculus
 PROC. OF 17TH INT. CONFERENCE RTA 2006, VOLUME 4098 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2006
"... We present a rewriting system for the linear lambda calculus corresponding to the {!, ⊸}fragment of intuitionistic linear logic. This rewriting system is shown to be strongly normalizing, and ChurchRosser modulo the trivial commuting conversion. Thus it provides a simple decision method for the eq ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
We present a rewriting system for the linear lambda calculus corresponding to the {!, ⊸}fragment of intuitionistic linear logic. This rewriting system is shown to be strongly normalizing, and ChurchRosser modulo the trivial commuting conversion. Thus it provides a simple decision method for the equational theory of the linear lambda calculus. As an application we prove the strong normalization of the simply typed computational lambda calculus by giving a reductionpreserving translation into the linear lambda calculus.
LINEARUSE CPS TRANSLATIONS IN THE ENRICHED EFFECT CALCULUS
"... Abstract. The enriched effect calculus (EEC) is an extension of Moggi’s computational metalanguage with a selection of primitives from linear logic. This paper explores the enriched effect calculus as a target language for continuationpassingstyle (CPS) translations in which the typing of the tran ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The enriched effect calculus (EEC) is an extension of Moggi’s computational metalanguage with a selection of primitives from linear logic. This paper explores the enriched effect calculus as a target language for continuationpassingstyle (CPS) translations in which the typing of the translations enforces the linear usage of continuations. We first observe that established callbyvalue and callby name linearuse CPS translations of simplytyped lambdacalculus into intuitionistic linear logic (ILL) land in the fragment of ILL given by EEC. These two translations are uniformly generalised by a single generic translation of the enriched effect calculus into itself. As our main theorem, we prove that the generic selftranslation of EEC is involutive up to isomorphism. As corollaries, we obtain full completeness results, both for the generic translation, and for the original callbyvalue and callbyname translations. 1.
LINEARUSE CPS TRANSLATIONS IN THE ENRICHED EFFECT CALCULUS ∗
, 2012
"... Vol. 8(4:2)2012, pp. 1–27 www.lmcsonline.org ..."
(Show Context)
unknown title
"... We study the equational theory of Parigot’s secondorder λµcalculus in connection with a callbyname continuationpassing style (CPS) translation into a fragment of the secondorder λcalculus. It is observed that the relational parametricity on the target calculus induces a natural notion of equiv ..."
Abstract
 Add to MetaCart
(Show Context)
We study the equational theory of Parigot’s secondorder λµcalculus in connection with a callbyname continuationpassing style (CPS) translation into a fragment of the secondorder λcalculus. It is observed that the relational parametricity on the target calculus induces a natural notion of equivalence on the λµterms. On the other hand, the unconstrained relational parametricity on the λµcalculus turns out to be inconsistent with this CPS semantics. Following these facts, we propose to formulate the relational parametricity on the λµcalculus in a constrained way, which might be called “focal parametricity”. 1.
Additional services for Journal of Functional Programming:
"... How to cite this article: ALEXEY GOTSMAN and HONGSEOK YANG (2013). Modular verication of preemptive OS ..."
Abstract
 Add to MetaCart
(Show Context)
How to cite this article: ALEXEY GOTSMAN and HONGSEOK YANG (2013). Modular verication of preemptive OS