Sciweavers

155
Voted
CSL
2009
Springer
16 years 15 days ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
160
Voted
CSL
2009
Springer
16 years 15 days ago
Expanding the Realm of Systematic Proof Theory
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
Agata Ciabattoni, Lutz Straßburger, Kazushig...
154
Voted
CSL
2009
Springer
16 years 15 days ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
139
Voted
CSL
2009
Springer
16 years 15 days ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer
143
Voted
CSL
2009
Springer
16 years 15 days ago
Focalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
Guillaume Munch-Maccagnoni
151
Voted
CSL
2009
Springer
16 years 15 days ago
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
Jacques Duparc, Alessandro Facchini, Filip Murlak
111
Voted
CSL
2009
Springer
16 years 15 days ago
Non-Commutative First-Order Sequent Calculus
Abstract. This paper investigates a non-commutative first-order sequent calculus NCLK. For that, this paper extends a non-commutative positive fragment to a full first-order sequ...
Makoto Tatsuta
CSL
2009
Springer
16 years 15 days ago
Forcing and Type Theory
Thierry Coquand