Realizability: a machine for Analysis and Set Theory - Archive ouverte HAL Access content directly
Lectures Year : 2006

Realizability: a machine for Analysis and Set Theory

(1)
1

Abstract

The Curry-Howard (proof-program) correspondence in Analysis by means of a new technique of realizability
Fichier principal
Vignette du fichier
Geocal06.pdf (339.29 Ko) Télécharger le fichier

Dates and versions

cel-00154509 , version 1 (13-06-2007)

Identifiers

  • HAL Id : cel-00154509 , version 1

Cite

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⟩
251 View
215 Download

Share

Gmail Facebook Twitter LinkedIn More