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