Computer Science Logic: 11th International Workshop, CSL ’97 Annual Conference of the EACSL Aarhus, Denmark, August 23–29, 1997 Selected Papers

Samson Abramsky, Guy McCusker (auth.), Mogens Nielsen, Wolfgang Thomas (eds.)3540645705, 9783540645702

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL ’97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997.
The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state of the art in the area.

---

Table of contents :
Call-by-value games….Pages 1-17
LISA: A specification language based on WS2S….Pages 18-34
Evolution as a computational engine….Pages 35-55
Timeless games….Pages 56-77
From action calculi to linear logic….Pages 78-97
A sequent calculus for circumscription….Pages 98-114
Linear lower bounds and simulations in frege systems with substitutions….Pages 115-128
A formulation of linear logic based on dependency-relations….Pages 129-148
Resolution and the weak pigeonhole principle….Pages 149-156
Higher-order matching and tree automata….Pages 157-176
A proof-theoretical investigation of Zantema’s problem….Pages 177-188
Spectra with only unary function symbols….Pages 189-202
Classical proofs via basic logic….Pages 203-219
Canonization for L k -equivalence is Hard….Pages 220-238
Full abstractness for a functional/concurrent language with higher-order value-passing….Pages 239-254
A duality theory for quantitative semantics….Pages 255-274
A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion….Pages 275-294
Equational axioms of test algebra….Pages 295-310
Mona & Fido: The logic-automaton connection in practice….Pages 311-326
Existence of reduction hierarchies….Pages 327-340
A game-theoretic, concurrent and fair model of the typed λ-calculus, with full recursion….Pages 341-359
A conjunctive logical characterization of nondeterministic linear time….Pages 360-372
On the computational complexity of type 2 functionals….Pages 373-388
Categories with algebraic structure….Pages 389-405
Concurrent constraint programming and non-commutative logic….Pages 406-423
A hierarchical approach to monadic second-order logic over graphs….Pages 424-440
The monadic quantifier alternation hierarchy over grids and pictures….Pages 441-460
Padding and the expressive power of existential second-order logics….Pages 461-477
Rich ω -words and monadic second-order arithmetic….Pages 478-490
A simple ordinal recursive normalization of Gödel’s T….Pages 491-509