11. CSL 1997: Aarhus, Denmark

@proceedings{DBLP:conf/csl/1997,
  editor    = {Mogens Nielsen and
               Wolfgang Thomas},
  title     = {Computer Science Logic, 11th International Workshop, CSL '97,
               Annual Conference of the EACSL, Aarhus, Denmark, August 23-29,
               1997, Selected Papers},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1414},
  year      = {1998},
  isbn      = {3-540-64570-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Samson Abramsky, Guy McCusker: Call-by-Value Games. 1-17 BibTeX
• Abdelwaheb Ayari, David A. Basin, Andreas Podelski: LISA: A Specification Language Based on WS2S. 18-34 BibTeX
• Rolf Backofen, Peter Clote: Evolution as a Computational Engine. 35-55 BibTeX
• Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier: Timeless Games. 56-77 BibTeX
• Andrew Barber, Philippa Gardner, Masahito Hasegawa, Gordon D. Plotkin: From Action Calculi to Linear Logic. 78-97 BibTeX
• Piero A. Bonatti, Nicola Olivetti: A Sequent Calculus for Circumscription. 98-114 BibTeX
• Maria Luisa Bonet, Nicola Galesi: Linear Lower Bounds and Simulations in Frege Systems with Substitutions. 115-128 BibTeX
• Torben Braüner, Valeria de Paiva: A Formulation of Linear Logic Based on Dependency-Relations. 129-148 BibTeX
• Samuel R. Buss, Toniann Pitassi: Resolution and the Weak Pigeonhole Principle. 149-156 BibTeX
• Hubert Comon, Yan Jurski: Higher-Order Matching and Tree Automata. 157-176 BibTeX
• Thierry Coquand, Henrik Persson: A Proof-Theoretical Investigation of Zantema's Problem. 177-188 BibTeX
• Arnaud Durand, Ronald Fagin, Bernd Loescher: Spectra with Only Unary Function Symbols. 189-202 BibTeX
• Claudia Faggian: Classical Proofs via Basic Logic. 203-219 BibTeX
• Martin Grohe: Canonization for L^k-equivalence is Hard. 220-238 BibTeX
• Chrysafis Hartonas, Matthew Hennessy: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). 239-254 BibTeX
• Reinhold Heckmann, Michael Huth: A Duality Theory for Quantitative Semantics. 255-274 BibTeX
• Martin Hofmann: A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. 275-294 BibTeX
• Marco Hollenberg: Equational Axioms of Test Algebra. 295-310 BibTeX
• Nils Klarlund: Mona & Fido: The Logic-Automaton Connection in Practice. 311-326 BibTeX
• Orna Kupferman, Robert P. Kurshan, Mihalis Yannakakis: Existence of Reduction Hierarchies. 327-340 BibTeX
• Yiannis N. Moschovakis: A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion. 341-359 BibTeX
• Frédéric Olive: A Conjunctive Logical Characterization of Nondeterministic Linear Time. 360-372 BibTeX
• Elena Pezzoli: On the Computational Complexity of Type 2 Functionals. 373-388 BibTeX
• A. John Power: Categories with Algebraic Structure. 389-405 BibTeX
• Paul Ruet, François Fages: Concurrent Constraint Programming and Non-commutative Logic. 406-423 BibTeX
• Ina Schiering: A Hierarchical Approach to Monadic Second-Order Logic over Graphs. 424-440 BibTeX
• Nicole Schweikardt: The Monadic Quantifier Alternation Hierarchy over Grids and Pictures. 441-460 BibTeX
• Thomas Schwentick: Padding and the Expressive Power of Existential Second-Order Logics. 461-477 BibTeX
• Ludwig Staiger: Rich omega-Words and Monadic Second-Order Arithmetic. 478-490 BibTeX
• Paul J. Voda: A Simple Ordinal Recursive Normalization of Gödel's T. 491-509 BibTeX