2009 | OriginalPaper | Buchkapitel
Focalisation and Classical Realisability
verfasst von : Guillaume Munch-Maccagnoni
Erschienen in: Computer Science Logic
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.