Displaying similar documents to “μ-Bicomplete Categories and Parity Games”

Strong functors and interleaving fixpoints in game semantics

Pierre Clairambault (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We describe a sequent calculus with primitives for inductive and coinductive datatypes and equip it with reduction rules allowing a sound translation of Gödel’s system T. We introduce the notion of a , relying on a uniform interpretation of open formulas as strong functors. We show that any -closed category is a sound model for . We then turn to the construction of a concrete -closed category based on Hyland-Ong game semantics. The model relies on three main ingredients:...

Equivalences and Congruences on Infinite Conway Games

Furio Honsell, Marina Lenisa, Rekha Redamalla (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

Taking the view that infinite plays are , we study and . These admit a sharp presentation, where non-terminating games are seen as a and game contructors, such as , as . We have shown, in a previous paper, that Conway’s theory of terminating games can be rephrased naturally in terms of game . Namely, various conceptually independent notions of can be defined and shown to coincide on Conway’s terminating games. These are...

Equivalences and Congruences on Infinite Conway Games

Furio Honsell, Marina Lenisa, Rekha Redamalla (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

Taking the view that infinite plays are , we study and . These admit a sharp presentation, where non-terminating games are seen as a and game contructors, such as , as . We have shown, in a previous paper, that Conway’s theory of terminating games can be rephrased naturally in terms of game . Namely, various conceptually independent notions of can be defined and shown to coincide on Conway’s terminating games. These are...

Dynamic Programming Principle for tug-of-war games with noise

Juan J. Manfredi, Mikko Parviainen, Julio D. Rossi (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We consider a two-player zero-sum-game in a bounded open domain Ω described as follows: at a point x ∈ Ω, Players I and II play an ε-step tug-of-war game with probability α, and with probability β (α + β = 1), a random point in the ball of radius ε centered at x is chosen. Once the...

Dynamic Programming Principle for tug-of-war games with noise

Juan J. Manfredi, Mikko Parviainen, Julio D. Rossi (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We consider a two-player zero-sum-game in a bounded open domain Ω described as follows: at a point   Ω, Players I and II play an -step tug-of-war game with probability , and with probability ( +  = 1), a random point in the ball of radius centered at is chosen. Once the game position reaches the boundary, Player II pays Player I the amount given by a fixed payoff function . We give a detailed proof of the fact that...

Dynamic Programming Principle for tug-of-war games with noise

Juan J. Manfredi, Mikko Parviainen, Julio D. Rossi (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We consider a two-player zero-sum-game in a bounded open domain Ω described as follows: at a point   Ω, Players I and II play an -step tug-of-war game with probability , and with probability ( +  = 1), a random point in the ball of radius centered at is chosen. Once the game position reaches the boundary, Player II pays Player I the amount given by a fixed payoff function . We give a detailed proof of the fact that...