Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Computer Science Logic

11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Mogens Nielsen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Wolfgang Thomas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1414)

Included in the following conference series:

Conference proceedings info: CSL 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Keywords

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. Call-by-value games

    • Samson Abramsky, Guy McCusker
    Pages 1-17

  3. LISA: A specification language based on WS2S

    • Abdelwaheb Ayari, David Basin, Andreas Podelski
    Pages 18-34

  4. Evolution as a computational engine

    • Rolf Backofen, Peter Clote
    Pages 35-55

  5. Timeless games

    • Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier
    Pages 56-77

  6. From action calculi to linear logic

    • Andrew Barber, Philippa Gardner, Masahito Hasegawa, Gordon Plotkin
    Pages 78-97

  7. A sequent calculus for circumscription

    • P. A. Bonatti, N. Olivetti
    Pages 98-114

  8. Linear lower bounds and simulations in frege systems with substitutions

    • Maria Luisa Bonet, Nicola Galesi
    Pages 115-128

  9. A formulation of linear logic based on dependency-relations

    • Torben Braüner, Valeria de Paiva
    Pages 129-148

  10. Resolution and the weak pigeonhole principle

    • Sam Buss, Toniann Pitassi
    Pages 149-156

  11. Higher-order matching and tree automata

    • Hubert Comon, Yan Jurski
    Pages 157-176

  12. A proof-theoretical investigation of Zantema's problem

    • Thierry Coquand, Henrik Persson
    Pages 177-188

  13. Spectra with only unary function symbols

    • Arnaud Durand, Ronald Fagin, Bernd Loescher
    Pages 189-202

  14. Classical proofs via basic logic

    • Claudia Faggian
    Pages 203-219

  15. Canonization for Lk-equivalence is Hard

    • Martin Grohe
    Pages 220-238

  16. Full abstractness for a functional/concurrent language with higher-order value-passing

    • Chrysafis Hartonas, Matthew Hennessy
    Pages 239-254

  17. A duality theory for quantitative semantics

    • Reinhold Heckmann, Michael Huth
    Pages 255-274

  18. A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion

    • Martin Hofmann
    Pages 275-294

  19. Equational axioms of test algebra

    • Marco Hollenberg
    Pages 295-310

  20. Mona & Fido: The logic-automaton connection in practice

    • Nils Klarlund
    Pages 311-326
Back to top

Other volumes

  1. Computer Science Logic

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation