CSL B

37 papers

YearTitle / Authors
2008A Calculus of Realizers for EM1 Arithmetic (Extended Abstract).
Stefano Berardi, Ugo de'Liguoro
2008A Characterisation of Lambda Definability with Sums Via TT-Closure Operators.
Shin-ya Katsumata
2008A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic.
Paolo Tranquilli
2008A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.
Olivier Hermant, James Lipton
2008A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.
Olaf Beyersdorff, Sebastian Müller
2008An Indexed System for Multiplicative Additive Polarized Linear Logic.
Masahiro Hamano, Ryo Takemura
2008An Infinite Automaton Characterization of Double Exponential Time.
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
2008An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.
Sven Schewe
2008Characterization of Logics over Ranked Tree Languages.
Thomas Place
2008Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings
Michael Kaminski, Simone Martini
2008Continuous Fragment of the mu-Calculus.
Gaëlle Fontaine
2008Extensional Uniformity for Boolean Circuits.
Pierre McKenzie, Michael Thomas, Heribert Vollmer
2008Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars.
Ruzica Piskac, Viktor Kuncak
2008Model Transformations in Decidability Proofs for Monadic Theories.
Wolfgang Thomas
2008Molecules as Automata.
Luca Cardelli
2008Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T.
Ian M. Hodkinson, Angelo Montanari, Guido Sciavicco
2008Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.
Nadia Creignou, Henning Schnoor, Ilka Schnoor
2008On Counting Generalized Colorings.
Tomer Kotek, Johann A. Makowsky, Boris Zilber
2008On Isomorphisms of Intersection Types.
Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta
2008On the Almighty Wand.
Rémi Brochenin, Stéphane Demri, Étienne Lozes
2008On the Relations between the Syntactic Theories of lambda-mu-Calculi.
Alexis Saurin
2008Proving Infinitude of Prime Numbers Using Binomial Coefficients.
Phuong Nguyen
2008Pure Pointer Programs with Iteration.
Martin Hofmann, Ulrich Schöpp
2008Quantified Positive Temporal Constraints.
Witold Charatonik, Michal Wrona
2008Quantitative Game Semantics for Linear Logic.
Ugo Dal Lago, Olivier Laurent
2008Quantitative Languages.
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
2008Recursion Schemata for NCk.
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2008Superposition for Fixed Domains.
Matthias Horbach, Christoph Weidenbach
2008Syntactic Metatheory of Higher-Order Subtyping.
Andreas Abel, Dulma Rodriguez
2008The Ackermann Award 2008.
Johann A. Makowsky, Damian Niwinski
2008The Computability Path Ordering: The End of a Quest.
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
2008The Descriptive Complexity of Parity Games.
Anuj Dawar, Erich Grädel
2008The Joy of String Diagrams.
Pierre-Louis Curien
2008The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.
Thomas Colcombet, Christof Löding
2008Type-Based Termination with Sized Products.
Gilles Barthe, Benjamin Grégoire, Colin Riba
2008Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano
2008Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract).
Jochen Eisinger