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-14
Contributed Papers
- Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
An Infinite Automaton Characterization of Double Exponential Time. 33-48 - Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Recursion Schemata for NCk. 49-63 - Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. 64-78 - Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. 109-123 - Ruzica Piskac, Viktor Kuncak:
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars. 124-138 - Olivier Hermant, James Lipton:
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. 169-183 - Olaf Beyersdorff, Sebastian Müller:
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. 199-214 - Stefano Berardi, Ugo de'Liguoro:
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract). 215-229 - Paolo Tranquilli:
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic. 246-261 - Masahiro Hamano, Ryo Takemura:
An Indexed System for Multiplicative Additive Polarized Linear Logic. 262-277 - Shin-ya Katsumata:
A Characterisation of Lambda Definability with Sums Via TT-Closure Operators. 278-292 - Ian M. Hodkinson, Angelo Montanari, Guido Sciavicco:
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T. 308-322 - Thomas Colcombet, Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. 416-430 - Jochen Eisinger:
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). 431-445 - Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta:
On Isomorphisms of Intersection Types. 461-477 - Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano:
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. 478-492
maintained by 
, founded at 
, founded at 
last updated on 2019-02-17 19:43 CET 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:
