Results 1 
6 of
6
A Computational Interpretation of the λμcalculus
, 1998
"... This paper proposes a simple computational interpretation of Parigot's calculus. The calculus is an extension of the typed calculus which corresponds via the CurryHoward correspondence to classical logic. Whereas other work has given computational interpretations by translating the calculus int ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This paper proposes a simple computational interpretation of Parigot's calculus. The calculus is an extension of the typed calculus which corresponds via the CurryHoward correspondence to classical logic. Whereas other work has given computational interpretations by translating the calculus into other calculi, I wish to propose here that the calculus itself has a simple computational interpretation: it is a typed  calculus which is able to save and restore the runtime environment. This interpretation is best given as a singlestep semantics which, in particular, leads to a relatively simple, but powerful, operational theory.
A Computational Interpretation of the
"... This paper proposes a simple computational interpretation of Parigot's calculus. The calculus is an extension of the typed calculus which corresponds via the CurryHoward correspondence to classical logic. Whereas other work has given computational interpretations by translating the calculus int ..."
Abstract
 Add to MetaCart
This paper proposes a simple computational interpretation of Parigot's calculus. The calculus is an extension of the typed calculus which corresponds via the CurryHoward correspondence to classical logic. Whereas other work has given computational interpretations by translating the calculus into other calculi, I wish to propose here that the calculus itself has a simple computational interpretation: it is a typed  calculus which is able to save and restore the runtime environment. This interpretation is best given as a singlestep semantics which, in particular, leads to a relatively simple, but powerful, operational theory. This is an expanded version of a paper presented at the 23rd International Symposium on Mathematical Foundations of Computer Science. August 24 28, 1998. Brno, Czech Republic. c fl G M B September 2, 1998 i 1 Introduction It is wellknown that the typed calculus can be viewed as a term assignment for natural deduction proofs in intuitionistic logic ...
unknown title
, 905
"... Arithmetical proofs of strong normalization results for symmetric λcalculi ..."
Abstract
 Add to MetaCart
Arithmetical proofs of strong normalization results for symmetric λcalculi
Philippe de Groote
, 2009
"... présentée en vue de l’obtention du grade de Docteur de l’Université de Savoie Spécialité: Mathématiques et Informatique par ..."
Abstract
 Add to MetaCart
présentée en vue de l’obtention du grade de Docteur de l’Université de Savoie Spécialité: Mathématiques et Informatique par