This work is devoted to Krivine's Realizability, focusing over computational aspects of realizers. Each formula has associated a game. Each proof of a formula gives a term implementing a winning strategy for the game associated to the proven formula. A proof is, by soundness, a combinator capable to take winning strategies of the premises and furnish a winning strategy for the conclusion. Are treated the following topics: A. The specification problem, which consists in characterize all realizers of a given formula in computational terms. Many examples are given. B. We study a proof as a combinator of winning strategies: Consider an implication $A\to B$ where $A$ and $B$ are $\Sigma^0_2$ formulae. Consider $C$ the prenex normal form of the i...
This thesis formalizes a model of bounded rationality in extensive-form games called game-playing sc...
Computing solution concepts in games is an important endeavor in the field of algorithmic game theor...
This thesis focuses on the computational interpretation of Cohen's forcing through the classical Cur...
The goal of this thesis is to compute the winning strategies of combinatorial games. We show how to ...
International audienceIn this paper we treat the specification problem in Krivine classical realizab...
This thesis studies different aspects of Jean-Louis Krivine's classical realizability. This principl...
Nous cherchons dans cette thèse à calculer les stratégies gagnantes de jeux combinatoires avec un pr...
This thesis investigates two realizability models for classical logic built on HO game semantics. Th...
International audienceGame semantics describe the interactive behavior of proofs by interpreting for...
M. Guy Cousineau président M. François Fages rapporteur M. Furio Honsell rapporteur M. Roberto Di Co...
I studied three optimization problems on graphs and combinatorial games.First, identifying codes wer...
The aim of this thesis is to determine algorithms that help to solve combinatorial games by computat...
Game semantics characterize the interactive behaviour of proofs and programs, by modeling them as st...
Ehrenfeucht-Fra\uefss\ue9 games are commonly used as a method to measure the expressive power of a l...
This work is a contribution to game semantics for programming languages. We describe new methods use...
This thesis formalizes a model of bounded rationality in extensive-form games called game-playing sc...
Computing solution concepts in games is an important endeavor in the field of algorithmic game theor...
This thesis focuses on the computational interpretation of Cohen's forcing through the classical Cur...
The goal of this thesis is to compute the winning strategies of combinatorial games. We show how to ...
International audienceIn this paper we treat the specification problem in Krivine classical realizab...
This thesis studies different aspects of Jean-Louis Krivine's classical realizability. This principl...
Nous cherchons dans cette thèse à calculer les stratégies gagnantes de jeux combinatoires avec un pr...
This thesis investigates two realizability models for classical logic built on HO game semantics. Th...
International audienceGame semantics describe the interactive behavior of proofs by interpreting for...
M. Guy Cousineau président M. François Fages rapporteur M. Furio Honsell rapporteur M. Roberto Di Co...
I studied three optimization problems on graphs and combinatorial games.First, identifying codes wer...
The aim of this thesis is to determine algorithms that help to solve combinatorial games by computat...
Game semantics characterize the interactive behaviour of proofs and programs, by modeling them as st...
Ehrenfeucht-Fra\uefss\ue9 games are commonly used as a method to measure the expressive power of a l...
This work is a contribution to game semantics for programming languages. We describe new methods use...
This thesis formalizes a model of bounded rationality in extensive-form games called game-playing sc...
Computing solution concepts in games is an important endeavor in the field of algorithmic game theor...
This thesis focuses on the computational interpretation of Cohen's forcing through the classical Cur...