Skip to main content
  • Conference proceedings
  • © 1996

Computer Science Logic

9th International Workshop, CSl '95, Annual Conference of the EACSL Paderborn, Germany, September 22-29, 1995. Selected Papers

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

Conference series link(s): CSL: International Workshop on Computer Science Logic

Conference proceedings info: CSL 1995.

Buy it now

Buying options

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

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

Table of contents (27 papers)

  1. Front Matter

  2. Incompleteness of a first-order gödel logic and some temporal logics of programs

    • Matthias Baaz, Alexander Leitsch, Richard Zach
    Pages 1-15
  3. Congruence Types

    • Gilles Barthe, Herman Geuvers
    Pages 36-51
  4. Deduction by combining semantic tableaux and integer programming

    • Bernhard Beckert, Reiner Hähnle
    Pages 52-63
  5. leanEA: A lean evolving algebra compiler

    • Bernhard Beckert, Joachim Posegga
    Pages 64-85
  6. A proof system for finite trees

    • Patrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke
    Pages 86-105
  7. Representing unification in a logical framework

    • Jason Brown, Lincoln A. Wallen
    Pages 106-129
  8. Decision procedures using model building techniques

    • Ricardo Caferra, Nicolas Peltier
    Pages 130-144
  9. First order logic, fixed point logic and linear order

    • Anuj Dawar, Steven Lindell, Scott Weinstein
    Pages 161-177
  10. Simultaneous rigid E-unification is undecidable

    • Anatoli Degtyarev, Andrei Voronkov
    Pages 178-190
  11. An evolving algebra abstract machine

    • Giuseppe Del Castillo, Igor Đurđanović, Uwe Glässer
    Pages 191-214
  12. Rewriting with extensional polymorphic λ-calculus

    • Roberto Di Cosmo, Delia Kesner
    Pages 215-232
  13. Languages and logical definability in concurrency monoids

    • Manfred Droste, Dietrich Kuske
    Pages 233-251
  14. Generalized implicit definitions on finite structures

    • Stéphane Grumbach, Zoé Lacroix, Steven Lindell
    Pages 252-265
  15. A logical aspect of parametric polymorphism

    • Ryu Hasegawa
    Pages 291-307
  16. On the modal logic K plus theories

    • Alain Heuerding, Stefan Schwendimann
    Pages 308-319

Other Volumes

  1. Computer Science Logic

About this book

This book contains a carefully refereed selection of papers presented at the 1995 Annual Conference of the European Association for Computer Science Logic, CSL '95, held in Paderborn, Germany, in September 1995.
The 27 revised full papers included were selected after two rounds of reviewing from a total of 74 submissions for presentation at the conference and present the state-of-the-art in the area. Among the topics addressed are temporal logics, rewriting systems, deduction, theorem proving, process algebra, linear logics, proof theory, formal languages, and others.

Bibliographic Information

Buy it now

Buying options

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