Conferences in DBLP

Conference for Computer Science Logic (CSL) (csl)
2008 (conf/csl/2008)

1. 
   The Computability Path Ordering: The End of a Quest. [Citation Graph (, )][DBLP]
   
   
2. 
   The Joy of String Diagrams. [Citation Graph (, )][DBLP]
   
   
3. 
   Model Transformations in Decidability Proofs for Monadic Theories. [Citation Graph (, )][DBLP]
   
   
4. 
   Molecules as Automata. [Citation Graph (, )][DBLP]
   
   
5. 
   An Infinite Automaton Characterization of Double Exponential Time. [Citation Graph (, )][DBLP]
   
   
6. 
   Recursion Schemata for NCk. [Citation Graph (, )][DBLP]
   
   
7. 
   Extensional Uniformity for Boolean Circuits. [Citation Graph (, )][DBLP]
   
   
8. 
   Pure Pointer Programs with Iteration. [Citation Graph (, )][DBLP]
   
   
9. 
   Quantified Positive Temporal Constraints. [Citation Graph (, )][DBLP]
   
   
10. 
    Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. [Citation Graph (, )][DBLP]
    
    
11. 
    Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars. [Citation Graph (, )][DBLP]
    
    
12. 
    Continuous Fragment of the mu-Calculus. [Citation Graph (, )][DBLP]
    
    
13. 
    On the Relations between the Syntactic Theories of lambda-mu-Calculi. [Citation Graph (, )][DBLP]
    
    
14. 
    A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. [Citation Graph (, )][DBLP]
    
    
15. 
    Proving Infinitude of Prime Numbers Using Binomial Coefficients. [Citation Graph (, )][DBLP]
    
    
16. 
    A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. [Citation Graph (, )][DBLP]
    
    
17. 
    A Calculus of Realizers for EM1 Arithmetic (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
18. 
    Quantitative Game Semantics for Linear Logic. [Citation Graph (, )][DBLP]
    
    
19. 
    A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic. [Citation Graph (, )][DBLP]
    
    
20. 
    An Indexed System for Multiplicative Additive Polarized Linear Logic. [Citation Graph (, )][DBLP]
    
    
21. 
    A Characterisation of Lambda Definability with Sums Via TT-Closure Operators. [Citation Graph (, )][DBLP]
    
    
22. 
    Superposition for Fixed Domains. [Citation Graph (, )][DBLP]
    
    
23. 
    Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T. [Citation Graph (, )][DBLP]
    
    
24. 
    On the Almighty Wand. [Citation Graph (, )][DBLP]
    
    
25. 
    On Counting Generalized Colorings. [Citation Graph (, )][DBLP]
    
    
26. 
    The Descriptive Complexity of Parity Games. [Citation Graph (, )][DBLP]
    
    
27. 
    An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games. [Citation Graph (, )][DBLP]
    
    
28. 
    Quantitative Languages. [Citation Graph (, )][DBLP]
    
    
29. 
    Characterization of Logics over Ranked Tree Languages. [Citation Graph (, )][DBLP]
    
    
30. 
    The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. [Citation Graph (, )][DBLP]
    
    
31. 
    Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
32. 
    Syntactic Metatheory of Higher-Order Subtyping. [Citation Graph (, )][DBLP]
    
    
33. 
    On Isomorphisms of Intersection Types. [Citation Graph (, )][DBLP]
    
    
34. 
    Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. [Citation Graph (, )][DBLP]
    
    
35. 
    Type-Based Termination with Sized Products. [Citation Graph (, )][DBLP]
    
    
36. 
    The Ackermann Award 2008. [Citation Graph (, )][DBLP]