Michael Kaminski, Simone Martini
Proceedings of the 17th EACSL Annual Conference / 22nd International Workshop on Computer Science Logic
CSL, 2008.

@proceedings{CSL-2008,
	address       = "Bertinoro, Italy",
	editor        = "Michael Kaminski and Simone Martini",
	isbn          = "978-3-540-87530-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 17th EACSL Annual Conference / 22nd International Workshop on Computer Science Logic}",
	volume        = 5213,
	year          = 2008,
}

Contents (35 items)

5 ×#linear
5 ×#logic
4 ×#on the
3 ×#automaton
3 ×#bound
3 ×#calculus
3 ×#game studies
3 ×#semantics
3 ×#μ-calculus
2 ×#axiom

CSL-2008-BlanquiJR #order

The Computability Path Ordering: The End of a Quest (FB, JPJ, AR), pp. 1–14.

CSL-2008-Curien #diagrams #string

The Joy of String Diagrams (PLC), pp. 15–22.

CSL-2008-Thomas #decidability #model transformation #monad #proving

Model Transformations in Decidability Proofs for Monadic Theories (WT), pp. 23–31.

CSL-2008-Cardelli #automaton

Molecules as Automata (LC), p. 32.

CSL-2008-TorreMP #automaton #exponential #infinity

An Infinite Automaton Characterization of Double Exponential Time (SLT, PM, GP), pp. 33–48.

CSL-2008-BonfanteKMO #recursion

Recursion Schemata for NCk (GB, RK, JYM, IO), pp. 49–63.

CSL-2008-McKenzieTV

Extensional Uniformity for Boolean Circuits (PM, MT, HV), pp. 64–78.

CSL-2008-HofmannS #pointer #source code

Pure Pointer Programs with Iteration (MH, US), pp. 79–93.

CSL-2008-CharatonikW #constraints #quantifier

Quantified Positive Temporal Constraints (WC, MW), pp. 94–108.

CSL-2008-CreignouSS #constraints #problem

Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (NC, HS, IS), pp. 109–123.

CSL-2008-PiskacK #bound #linear

Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (RP, VK), pp. 124–138.

CSL-2008-Fontaine #calculus #μ-calculus

Continuous Fragment of the μ-Calculus (GF), pp. 139–153.

CSL-2008-Saurin #on the #λ-calculus #μ-calculus

On the Relations between the Syntactic Theories of λμ-Calculi (AS), pp. 154–168.

CSL-2008-HermantL #approach #axiom #semantics

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (OH, JL), pp. 169–183.

CSL-2008-Nguyen #proving #using

Proving Infinitude of Prime Numbers Using Binomial Coefficients (PN), pp. 184–198.

CSL-2008-BeyersdorffM #bound

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (OB, SM), pp. 199–214.

CSL-2008-Berardid #calculus

A Calculus of Realizers for EM1 Arithmetic (SB, Ud), pp. 215–229.

CSL-2008-LagoL #game studies #linear #logic #semantics

Quantitative Game Semantics for Linear Logic (UDL, OL), pp. 230–245.

CSL-2008-Tranquilli #correctness #linear #logic #multi #semantics

A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic (PT), pp. 246–261.

CSL-2008-HamanoT #linear #logic #multi

An Indexed System for Multiplicative Additive Polarized Linear Logic (MH, RT), pp. 262–277.

CSL-2008-Katsumata

A Characterisation of λ Definability with Sums Via TT-Closure Operators (SyK), pp. 278–292.

CSL-2008-HorbachW

Superposition for Fixed Domains (MH, CW), pp. 293–307.

CSL-2008-HodkinsonMS #axiom #logic

Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T (IMH, AM, GS), pp. 308–322.

CSL-2008-BrocheninDL #on the

On the Almighty Wand (RB, SD, ÉL), pp. 323–338.

CSL-2008-KotekMZ #on the

On Counting Generalized Colorings (TK, JAM, BZ), pp. 339–353.

CSL-2008-DawarG #complexity #game studies

The Descriptive Complexity of Parity Games (AD, EG), pp. 354–368.

CSL-2008-Schewe #algorithm #game studies

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (SS), pp. 369–384.

CSL-2008-ChatterjeeDH

Quantitative Languages (KC, LD, TAH), pp. 385–400.

CSL-2008-Place #logic

Characterization of Logics over Ranked Tree Languages (TP), pp. 401–415.

CSL-2008-ColcombetL #calculus #problem #μ-calculus

The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.

CSL-2008-Eisinger #automaton #bound #integer #linear

Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (JE), pp. 431–445.

CSL-2008-AbelR #higher-order #type system

Syntactic Metatheory of Higher-Order Subtyping (AA, DR), pp. 446–460.

CSL-2008-Dezani-CiancagliniCGT #morphism #on the

On Isomorphisms of Intersection Types (MDC, RDC, EG, MT), pp. 461–477.

CSL-2008-NakazawaTKN #λ-calculus

Undecidability of Type-Checking in Domain-Free Typed λ-Calculi with Existence (KN, MT, YK, HN), pp. 478–492.

CSL-2008-BartheGR #termination #type system

Type-Based Termination with Sized Products (GB, BG, CR), pp. 493–507.