 |
|
|
|
| HAL: hal-00154500, version 1 |
| Detailed view |  Export this paper |
|
|
| Panoramas et synthèses 27 (2009) 197-229 |
|
|
|
|
| Realizability in classical logic |
|
|
| Jean-Louis Krivine 1 |
|
|
| (2009) |
|
|
|
| We explore the Curry-Howard (proof-program) correspondence in Analysis (classical second order arithmetic with dependent choice). The essential tool is a new form of realizability. This paper will appear in "Panoramas et synthèses". |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| PPS |
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science |
|
|
| lambda-calculus – proof-program correspondence |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00154500, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00154500 | |
| oai:hal.archives-ouvertes.fr:hal-00154500 | |
| From: Jean-Louis Krivine | |
| Submitted on: Wednesday, 13 June 2007 18:49:35 | |
| Updated on: Saturday, 25 September 2010 11:24:40 | |
