Focalisation and Classical Realisability (version with appendices) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Focalisation and Classical Realisability (version with appendices)

Abstract

We develop a polarised variant of Curien and Herbelin's lambda-bar-mu-mu-tilde calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised when cut-free), such as Girard's classical logic LC or linear logic. This gives a setting in which Krivine's classical realisability extends naturally (in particular to call-by-value), with a presentation in terms of orthogonality. We give examples of applications to the theory of programming languages.
Fichier principal
Vignette du fichier
focalisation_and_classical_realisability_long.pdf (354.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00409793 , version 1 (12-08-2009)
inria-00409793 , version 2 (29-06-2010)

Identifiers

Cite

Guillaume Munch-Maccagnoni. Focalisation and Classical Realisability (version with appendices). 18th EACSL Annual Conference on Computer Science Logic - CSL 09, Sep 2009, Coimbra, Portugal. pp.409-423, ⟨10.1007/978-3-642-04027-6_30⟩. ⟨inria-00409793v2⟩
228 View
503 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More