## Mogens Nielsen, Wolfgang Thomas

*Selected Papers of the 11th International Workshop on Computer Science Logic / Annual Conference of the EACSL*

CSL, 1997.

@proceedings{CSL-1997, address = "Aarhus, Denmark", editor = "Mogens Nielsen and Wolfgang Thomas", isbn = "3-540-64570-5", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Selected Papers of the 11th International Workshop on Computer Science Logic / Annual Conference of the EACSL}", volume = 1414, year = 1997, }

### Contents (30 items)

- CSL-1997-AbramskyM #call-by #game studies
- Call-by-Value Games (SA, GM), pp. 1–17.
- CSL-1997-AyariBP #named #specification
- LISA: A Specification Language Based on WS2S (AA, DAB, AP), pp. 18–34.
- CSL-1997-BackofenC #evolution
- Evolution as a Computational Engine (RB, PC), pp. 35–55.
- CSL-1997-BaillotDER #game studies
- Timeless Games (PB, VD, TE, LR), pp. 56–77.
- CSL-1997-BarberGHP #calculus #linear #logic
- From Action Calculi to Linear Logic (AB, PG, MH, GDP), pp. 78–97.
- CSL-1997-BonattiO #calculus
- A Sequent Calculus for Circumscription (PAB, NO), pp. 98–114.
- CSL-1997-BonetG #bound #linear #simulation
- Linear Lower Bounds and Simulations in Frege Systems with Substitutions (MLB, NG), pp. 115–128.
- CSL-1997-BraunerP #linear #logic
- A Formulation of Linear Logic Based on Dependency-Relations (TB, VdP), pp. 129–148.
- CSL-1997-BussP #principle
- Resolution and the Weak Pigeonhole Principle (SRB, TP), pp. 149–156.
- CSL-1997-ComonJ #automaton #higher-order
- Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
- CSL-1997-CoquandP #problem
- A Proof-Theoretical Investigation of Zantema’s Problem (TC, HP), pp. 177–188.
- CSL-1997-DurandFL
- Spectra with Only Unary Function Symbols (AD, RF, BL), pp. 189–202.
- CSL-1997-Faggian #logic #proving
- Classical Proofs via Basic Logic (CF), pp. 203–219.
- CSL-1997-Grohe
- Canonization for Lk-equivalence is Hard (MG), pp. 220–238.
- CSL-1997-HartonasH #concurrent #functional #higher-order
- Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (CH, MH), pp. 239–254.
- CSL-1997-HeckmannH #semantics
- A Duality Theory for Quantitative Semantics (RH, MH), pp. 255–274.
- CSL-1997-Hofmann #linear #recursion #λ-calculus
- A Mixed Modal/Linear λ Calculus with Applications to Bellantoni-Cook Safe Recursion (MH0), pp. 275–294.
- CSL-1997-Hollenberg #algebra #axiom #equation
- Equational Axioms of Test Algebra (MH), pp. 295–310.
- CSL-1997-Klarlund
- Mona & Fido: The Logic-Automaton Connection in Practice (NK), pp. 311–326.
- CSL-1997-KupfermanKY #reduction
- Existence of Reduction Hierarchies (OK, RPK, MY), pp. 327–340.
- CSL-1997-Moschovakis #concurrent #game studies #recursion #λ-calculus
- A Game-Theoretic, Concurrent and Fair Model of the Typed λ-calculus, with Full Recursion (YNM), pp. 341–359.
- CSL-1997-Olive #linear #logic #nondeterminism
- A Conjunctive Logical Characterization of Nondeterministic Linear Time (FO), pp. 360–372.
- CSL-1997-Pezzoli #complexity #on the
- On the Computational Complexity of Type 2 Functionals (EP), pp. 373–388.
- CSL-1997-Power #algebra #category theory
- Categories with Algebraic Structure (AJP), pp. 389–405.
- CSL-1997-RuetF #commutative #concurrent #constraints #logic #programming
- Concurrent Constraint Programming and Non-commutative Logic (PR, FF), pp. 406–423.
- CSL-1997-Schiering #approach #graph #higher-order #logic #monad
- A Hierarchical Approach to Monadic Second-Order Logic over Graphs (IS), pp. 424–440.
- CSL-1997-Schweikardt #monad #quantifier
- The Monadic Quantifier Alternation Hierarchy over Grids and Pictures (NS), pp. 441–460.
- CSL-1997-Schwentick #higher-order #logic #power of
- Padding and the Expressive Power of Existential Second-Order Logics (TS), pp. 461–477.
- CSL-1997-Staiger #higher-order #monad
- Rich ω-Words and Monadic Second-Order Arithmetic (LS), pp. 478–490.
- CSL-1997-Voda #normalisation #recursion
- A Simple Ordinal Recursive Normalization of Gödel’s T (PJV), pp. 491–509.

7 ×#logic

5 ×#higher-order

5 ×#linear

3 ×#concurrent

3 ×#game studies

3 ×#monad

3 ×#recursion

2 ×#algebra

2 ×#calculus

2 ×#λ-calculus

5 ×#higher-order

5 ×#linear

3 ×#concurrent

3 ×#game studies

3 ×#monad

3 ×#recursion

2 ×#algebra

2 ×#calculus

2 ×#λ-calculus