Strong functors and interleaving fixpoints in game semantics

Pierre Clairambault

Displaying similar documents to “Strong functors and interleaving fixpoints in game semantics”

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:

Generalizing Substitution

Tarmo Uustalu (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

It is well known that, given an endofunctor on a category , the initial -algebras (if existing), , the algebras of (wellfounded) -terms over different variable supplies , give rise to a monad with substitution as the extension operation (the free monad induced by the functor ). Moss [17] and Aczel, Adámek, Milius and Velebil [12] have shown that a similar monad, which even enjoys the additional special property of having iterations for all guarded substitution rules (complete...

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...

Encoding FIX in Object Calculi

Roy L. Crole (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the type theory introduced by Crole and Pitts [3] can be encoded in variants of Abadi and Cardelli's object calculi. More precisely, we show that the type theory presented with judgements of both equality and operational reduction can be translated into object calculi, and the translation proved sound. The translations we give can be seen as using object calculi as a metalanguge within which can be represented; an analogy can be drawn with Martin Löf's Theory of Arities...

Easy lambda-terms are not always simple

Alberto Carraro, Antonino Salibra (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

A closed -term is if, for any other closed term , the lambda theory generated by = is consistent. Recently, it has been introduced a general technique to prove the easiness of -terms through the semantical notion of simple easiness. Simple easiness implies easiness and allows to prove consistency results construction of suitable filter models of -calculus living in the category of complete partial orderings: given ...

Easy lambda-terms are not always simple

Alberto Carraro, Antonino Salibra (2012)

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

Similarity:

Nash equilibria for a model of traffic flow with several groups of drivers

Alberto Bressan, Ke Han (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Traffic flow is modeled by a conservation law describing the density of cars. It is assumed that each driver chooses his own departure time in order to minimize the sum of a departure and an arrival cost. There are groups of drivers, The -th group consists of drivers, sharing the same departure and arrival costs (), (). For any given population sizes ,, , we prove the existence of a Nash equilibrium solution,...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () = (||) to multiple integrals ∫ ((), |()|) on a ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Hydrodynamic limit of a d-dimensional exclusion process with conductances

Fábio Júlio Valentim (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Fix a polynomial of the form () = + ∑2≤≤ =1 with (1) gt; 0. We prove that the evolution, on the diffusive scale, of the empirical density of exclusion processes on $𝕋^{d}$ , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑ ...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...