A CPS-semantics for a typed lambda-calculus of exception handling with fixed-point - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

A CPS-semantics for a typed lambda-calculus of exception handling with fixed-point

Abstract

We propose to add a fixed-point combinator to a lambda- calculus of exception handling whose type system corresponds to classical logic through the Curry-Howard isomorphism. To this end, we here give a CPS-semantics to the calculus and show that for non-exceptional terms, this semantics possesses the property of computational adequacy.
Fichier principal
Vignette du fichier
98-R-123.pdf (186.41 Ko) Télécharger le fichier

Dates and versions

inria-00098699 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098699 , version 1

Cite

Catherine Pilière. A CPS-semantics for a typed lambda-calculus of exception handling with fixed-point. ESSLLI'98, 1998, none, 12 p. ⟨inria-00098699⟩
64 View
49 Download

Share

Gmail Facebook Twitter LinkedIn More