CSL 2009: Computer Science Logic pp 409-423

Focalisation and Classical Realisability

  • Guillaume Munch-Maccagnoni
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5771)

Abstract

We develop a polarised variant of Curien and Herbelin’s \(\bar{\lambda}\mu\tilde{\mu}\) 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Guillaume Munch-Maccagnoni
    • 1
  1. 1.Université Paris 7France

Personalised recommendations