We investigate a framework of Krivine realizability with I/O effects, and present a method of associating realizability models to specifications on the I/O behavior of processes, by using ad- equate interpretations of the central concepts of pole and proof-like term. This method does in particular allow to associate realizability models to computable functions. Following recent work of Streicher and others we show how these models give rise to triposes and toposes
International audienceWe explore the Curry-Howard (proof-program) correspondence in Analysis (classi...
AbstractTwo straightforward “extensionalisations” of Kleene's realizability are considered; denoted ...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
The modified realizability topos is the semantic (and higher order) counterpart of a variant of Krei...
AbstractThe modified realizability topos is the semantic (and higher order) counterpart of a variant...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
28 p.International audienceUsing the proof-program (Curry-Howard) correspondence, we give a new meth...
École thématiqueThe Curry-Howard (proof-program) correspondence in Analysis by means of a new techni...
We extend Krivine's classical realizability to a simply typed calculus with some constants and primi...
In this thesis, we are interested in semantical proof of correctness results for complex programming...
In this thesis, we are interested in semantical proof of correctness results for complex programming...
International audienceConstructive foundations have for decades been built upon realizability models...
We present a system, called RZ, for automatic generation of program specifications from mathematical...
We describe a systematic method to build a logic from any programming language described as a Pure T...
International audienceConstructive foundations have for decades been built upon realizability models...
International audienceWe explore the Curry-Howard (proof-program) correspondence in Analysis (classi...
AbstractTwo straightforward “extensionalisations” of Kleene's realizability are considered; denoted ...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
The modified realizability topos is the semantic (and higher order) counterpart of a variant of Krei...
AbstractThe modified realizability topos is the semantic (and higher order) counterpart of a variant...
Realizability toposes are "models of constructive set theory" based on abstract notions of computabi...
28 p.International audienceUsing the proof-program (Curry-Howard) correspondence, we give a new meth...
École thématiqueThe Curry-Howard (proof-program) correspondence in Analysis by means of a new techni...
We extend Krivine's classical realizability to a simply typed calculus with some constants and primi...
In this thesis, we are interested in semantical proof of correctness results for complex programming...
In this thesis, we are interested in semantical proof of correctness results for complex programming...
International audienceConstructive foundations have for decades been built upon realizability models...
We present a system, called RZ, for automatic generation of program specifications from mathematical...
We describe a systematic method to build a logic from any programming language described as a Pure T...
International audienceConstructive foundations have for decades been built upon realizability models...
International audienceWe explore the Curry-Howard (proof-program) correspondence in Analysis (classi...
AbstractTwo straightforward “extensionalisations” of Kleene's realizability are considered; denoted ...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...