International audienceWe will give a survey of some results in realizability including: * basic notions and control operators associated to Pierce's law. * the definition of data-types and storage operators (which are essential). * the interaction of intuitionistic and classical proofs to extract algorithm (illustrated by Dickson's lemma). * the use of the system clock to realize the intentional axiom of choice. We will also give a short list of open problems
We discuss the computational content of various choice principles and theorems using them. As a case...
We present a possible computational content of the negative translation of classical analysis with t...
The theory of classical realizability is a framework for the Curry-Howardcorrespondence which enable...
International audienceWe will give a survey of some results in realizability including: * basic noti...
International audienceThis paper is an introduction to recent works in realizability, mainly Krivine...
Abstract. We present a framework for classical realizability that contains both Krivine’s classical ...
This paper is an introduction to recent works in realizability, mainly Krivine’s work to realize the...
International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$...
J.L. Krivine developed a new method based on realizability to construct models of set theory where t...
Especially nice models of intuitionistic set theories are realizability models V(A)V(A), where AA i...
The theory of classical realizability is a framework in which we can developthe proof-program corres...
International audienceWe explore the Curry-Howard (proof-program) correspondence in Analysis (classi...
This thesis studies different aspects of Jean-Louis Krivine's classical realizability. This principl...
International audienceWe show how the language of Krivine's classical realizability may be used to s...
This article investigates Krivine’s realizability interpretation of classical second-order arithmeti...
We discuss the computational content of various choice principles and theorems using them. As a case...
We present a possible computational content of the negative translation of classical analysis with t...
The theory of classical realizability is a framework for the Curry-Howardcorrespondence which enable...
International audienceWe will give a survey of some results in realizability including: * basic noti...
International audienceThis paper is an introduction to recent works in realizability, mainly Krivine...
Abstract. We present a framework for classical realizability that contains both Krivine’s classical ...
This paper is an introduction to recent works in realizability, mainly Krivine’s work to realize the...
International audienceIn 1990 Krivine introduced the notion of storage operators. They are $\lambda$...
J.L. Krivine developed a new method based on realizability to construct models of set theory where t...
Especially nice models of intuitionistic set theories are realizability models V(A)V(A), where AA i...
The theory of classical realizability is a framework in which we can developthe proof-program corres...
International audienceWe explore the Curry-Howard (proof-program) correspondence in Analysis (classi...
This thesis studies different aspects of Jean-Louis Krivine's classical realizability. This principl...
International audienceWe show how the language of Krivine's classical realizability may be used to s...
This article investigates Krivine’s realizability interpretation of classical second-order arithmeti...
We discuss the computational content of various choice principles and theorems using them. As a case...
We present a possible computational content of the negative translation of classical analysis with t...
The theory of classical realizability is a framework for the Curry-Howardcorrespondence which enable...