Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar22. CSL 2008: Bertinoro, Italy
Michael Kaminski, Simone Martini:
Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings. Lecture Notes in Computer Science 5213, Springer 2008, ISBN 978-3-540-87530-7
Invited Talks
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The Computability Path Ordering: The End of a Quest. 1-14Pierre-Louis Curien:
The Joy of String Diagrams. 15-22Wolfgang Thomas:
Model Transformations in Decidability Proofs for Monadic Theories. 23-31Luca Cardelli:
Molecules as Automata. 32
Contributed Papers
Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
An Infinite Automaton Characterization of Double Exponential Time. 33-48Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Recursion Schemata for NCk. 49-63Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. 64-78Martin Hofmann, Ulrich Schöpp:
Pure Pointer Programs with Iteration. 79-93Witold Charatonik, Michal Wrona:
Quantified Positive Temporal Constraints. 94-108Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. 109-123Ruzica Piskac, Viktor Kuncak:
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars. 124-138Gaëlle Fontaine:
Continuous Fragment of the mu-Calculus. 139-153Alexis Saurin:
On the Relations between the Syntactic Theories of lambda-mu-Calculi. 154-168Olivier Hermant, James Lipton:
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. 169-183Phuong Nguyen:
Proving Infinitude of Prime Numbers Using Binomial Coefficients. 184-198Olaf Beyersdorff, Sebastian Müller:
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. 199-214Stefano Berardi, Ugo de'Liguoro:
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract). 215-229Ugo Dal Lago, Olivier Laurent:
Quantitative Game Semantics for Linear Logic. 230-245Paolo Tranquilli:
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic. 246-261Masahiro Hamano, Ryo Takemura:
An Indexed System for Multiplicative Additive Polarized Linear Logic. 262-277Shin-ya Katsumata:
A Characterisation of Lambda Definability with Sums Via TT-Closure Operators. 278-292Matthias Horbach, Christoph Weidenbach:
Superposition for Fixed Domains. 293-307Ian M. Hodkinson, Angelo Montanari, Guido Sciavicco:
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T. 308-322Rémi Brochenin, Stéphane Demri, Étienne Lozes:
On the Almighty Wand. 323-338Tomer Kotek, Johann A. Makowsky, Boris Zilber:
On Counting Generalized Colorings. 339-353Anuj Dawar, Erich Grädel:
The Descriptive Complexity of Parity Games. 354-368Sven Schewe:
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games. 369-384Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Quantitative Languages. 385-400Thomas Place:
Characterization of Logics over Ranked Tree Languages. 401-415Thomas Colcombet, Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. 416-430Jochen Eisinger:
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). 431-445Andreas Abel, Dulma Rodriguez:
Syntactic Metatheory of Higher-Order Subtyping. 446-460Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta:
On Isomorphisms of Intersection Types. 461-477Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano:
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. 478-492Gilles Barthe, Benjamin Grégoire, Colin Riba:
Type-Based Termination with Sized Products. 493-507Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2008. 508-512
last updated on 2019-10-21 23:33 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
