A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Focalisation and Classical Realisability
[chapter]
2009
Lecture Notes in Computer Science
We develop a polarised variant of Curien and Herbelin'sλµμ 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 callby-value), with a presentation in terms of orthogonality. We give examples of applications to the theory of programming languages. In this version extended
doi:10.1007/978-3-642-04027-6_30
fatcat:lfiecqfw3bezfc7yv2mwy2xmte