Skip to main content
SpringerLink
Log in

Computer Science Logic

10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21 - 27, 1996, Selected Papers

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Dirk Dalen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Marc Bezem
    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 1258)

Included in the following conference series:

Conference proceedings info: CSL 1996.

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 10th International Workshop on Computer Science Logic, CSL'96, held as the 5th Annual Conference of the European Association of Computer Science Logic (EACSL), in Utrecht, The Netherlands, in September 1996.
The volume presents 26 revised full papers selected from a total of initially 75 papers submitted; also included are two refereed invited contributions. The volume addresses all current issues in the area of computer science logic research, and is thus a unique record of recent progress in the area.

Similar content being viewed by others

Keywords

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Four-valued diagnoses for stratified knowledge-bases

    • Ofer Arieli, Arnon Avron
    Pages 1-17

  3. Fast cut-elimination by projection

    • Matthias Baaz, Alexander Leitsch
    Pages 18-33

  4. On the subject reduction property for algebraic type systems

    • G. Barthe, P. -A. Mellies
    Pages 34-57

  5. Presheaf models for concurrency

    • Gian Luca Cattani, Glynn Winskel
    Pages 58-75

  6. Directed virtual reductions

    • Vincent Danos, Marco Pedicini, Laurent Regnier
    Pages 76-88

  7. Bounded-variable fixpoint queries are PSPACE-complete

    • Stefan Dziembowski
    Pages 89-105

  8. Graph rewriting semantics for functional programming languages

    • Marko van Eekelen, Sjaak Smetsers, Rinus Plasmeijer
    Pages 106-128

  9. An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory

    • Marcelo P. Fiore, Gordon D. Plotkin
    Pages 129-149

  10. Relative undecidability in term rewriting

    • Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
    Pages 150-166

  11. Extending models of second order predicate logic to models of second order dependent type theory

    • Herman Geuvers
    Pages 167-181

  12. Eta-expansions in F ω

    • Neil Ghani
    Pages 182-197

  13. Cut-free display calculi for relation algebras

    • Rajeev Goré
    Pages 198-210

  14. Computational aspects of arity hierarchies

    • Henrik Imhof
    Pages 211-225

  15. Weak semantics based on lighted button pressing experiments

    • Anna Ingólfsdóttir
    Pages 226-243

  16. Kleene algebra with tests: Completeness and decidability

    • Dexter Kozen, Frederick Smith
    Pages 244-259

  17. Monadic NP and built-in trees

    • Martin Kreidler, Detlef Seese
    Pages 260-274

  18. Coercive subtyping in type theory

    • Zhaohui Luo
    Pages 275-296

  19. Proofs in system F ω can be done in system F 1ω

    • Sophie Malecki
    Pages 297-315

  20. Optimization problems with approximation schemes

    • Anders Malmström
    Pages 316-333
Back to top

Other volumes

  1. Computer Science Logic

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation