Realizability: a machine for Analysis and Set Theory

Jean-Louis Krivine 1
1 PPS - Preuves, Programmes et Systèmes
Abstract : The Curry-Howard (proof-program) correspondence in Analysis by means of a new technique of realizability
Document type :
Lectures
Complete list of metadatas
https://cel.archives-ouvertes.fr/cel-00154509
Contributor : Jean-Louis Krivine <>
Submitted on : Wednesday, June 13, 2007 - 7:29:06 PM
Last modification on : Friday, January 4, 2019 - 5:32:59 PM
Long-term archiving on : Thursday, April 8, 2010 - 8:09:50 PM

File

Geocal06.pdf

Identifiers

  • HAL Id : cel-00154509, version 1

Collections

UNIV-PARIS7 | PPS | INSMI | USPC

Citation

Jean-Louis Krivine. Realizability: a machine for Analysis and Set Theory. École thématique. Université de Luminy Février 2006, 2006, pp.106. ⟨cel-00154509⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

407

Files downloads

252

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD