Realizability: a machine for Analysis and Set Theory
Abstract
The Curry-Howard (proof-program) correspondence in Analysis by means of a new technique of realizability
Jean-Louis Krivine : Connect in order to contact the contributor
https://cel.hal.science/cel-00154509
Submitted on : Wednesday, June 13, 2007-7:29:06 PM
Last modification on : Saturday, June 25, 2022-8:46:57 PM
Long-term archiving on: Thursday, April 8, 2010-8:09:50 PM