23. LICS 2008:
Pittsburgh, Pennsylvania, USA
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA.
IEEE Computer Society 2008, ISBN 978-0-7695-3183-0 
Session 1 (Joint CSF/LICS)
Session 2 (Joint CSF/LICS)
Session 3:
Logical Frameworks
Session 4:
Lambda Calculus
Session 5:
Short Talks (Joint CSF/LICS)
Session 6:
Algebraic Reasoning
Session 7:
Process Calculi
Session 8:
Model Checking
Session 9:
Proof Theory
Session 10:
Computational Complexity
- Martin Grohe:
The Quest for a Logic Capturing PTIME.
267-271
- Søren Riis:
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity.
272-283
- Klaus Aehlig, Arnold Beckmann:
On the Computational Complexity of Cut-Reduction.
284-293
Session 11:
Constraints
Session 12:
Reasoning About Programs
- François Pottier:
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule.
331-340
- Søren B. Lassen, Paul Blain Levy:
Typed Normal Form Bisimulation for Parametric Polymorphism.
341-352
- Andrzej S. Murawski:
Reachability Games and Game Semantics: Comparing Nondeterministic Programs.
353-363
- Abbas Edalat:
Weak Topology and a Differentiable Operator for Lipschitz Maps.
364-375
Session 13:
Probabilistic Systems
Session 14:
Finite Model Theory
Session 15:
Automata Theory
Session 16:
Linear Logic
Last update Sun May 19 23:07:54 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
