Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio (auth.), Michael Kaminski, Simone Martini (eds.)3540875301, 9783540875307
This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Science Logic, CSL 2008, held as the 17th Annual Conference of the EACSL in Bertinoro, Italy, in September 2008.
The 31 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 102 submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year’s Ackermann award.
Table of contents :
Front Matter….Pages –
The Computability Path Ordering: The End of a Quest….Pages 1-14
The Joy of String Diagrams….Pages 15-22
Model Transformations in Decidability Proofs for Monadic Theories….Pages 23-31
Molecules as Automata….Pages 32-32
An Infinite Automaton Characterization of Double Exponential Time….Pages 33-48
Recursion Schemata for NC k ….Pages 49-63
Extensional Uniformity for Boolean Circuits….Pages 64-78
Pure Pointer Programs with Iteration….Pages 79-93
Quantified Positive Temporal Constraints….Pages 94-108
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint….Pages 109-123
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars….Pages 124-138
Continuous Fragment of the mu-Calculus….Pages 139-153
On the Relations between the Syntactic Theories of λμ -Calculi….Pages 154-168
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms….Pages 169-183
Proving Infinitude of Prime Numbers Using Binomial Coefficients….Pages 184-198
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic….Pages 199-214
A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)….Pages 215-229
Quantitative Game Semantics for Linear Logic….Pages 230-245
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic….Pages 246-261
An Indexed System for Multiplicative Additive Polarized Linear Logic….Pages 262-277
A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators….Pages 278-292
Superposition for Fixed Domains….Pages 293-307
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T….Pages 308-322
On the Almighty Wand….Pages 323-338
On Counting Generalized Colorings….Pages 339-353
The Descriptive Complexity of Parity Games….Pages 354-368
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games….Pages 369-384
Quantitative Languages….Pages 385-400
Characterization of Logics over Ranked Tree Languages….Pages 401-415
The Nesting-Depth of Disjunctive μ -Calculus for Tree Languages and the Limitedness Problem….Pages 416-430
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)….Pages 431-445
Syntactic Metatheory of Higher-Order Subtyping….Pages 446-460
On Isomorphisms of Intersection Types….Pages 461-477
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence….Pages 478-492
Type-Based Termination with Sized Products….Pages 493-507
The Ackermann Award 2008….Pages 508-512
Back Matter….Pages –
Reviews
There are no reviews yet.