Skip to main content
SpringerLink
Log in
Book cover

Computer Science Logic

8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Leszek Pacholski
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jerzy Tiuryn
    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 933)

Included in the following conference series:

Conference proceedings info: CSL 1994.

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 109.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

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  2. Subtyping with singleton types

    • David Aspinall
    Pages 1-15

  3. A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects

    • Viviana Bono, Luigi Liquori
    Pages 16-30

  4. The Girard Translation extended with recursion

    • Torben Braüner
    Pages 31-45

  5. Decidability of higher-order subtyping with intersection types

    • Adriana B. Compagnoni
    Pages 46-60

  6. A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure

    • Hugo Herbelin
    Pages 61-75

  7. Usability: formalising (un)definedness in typed lambda calculus

    • Jan Kuper
    Pages 76-90

  8. Lambda representation of operations between different term algebras

    • Marek Zaionc
    Pages 91-105

  9. Semi-unification and generalizations of a particularly simple form

    • Matthias Baaz, Gernot Salzer
    Pages 106-120

  10. A mixed linear and non-linear logic: Proofs, terms and models

    • P. N. Benton
    Pages 121-135

  11. Cut free formalization of logic with finitely many variables. Part I.

    • L. Gordeev
    Pages 136-150

  12. How to lie without being (easily) convicted and the lengths of proofs in propositional calculus

    • Pavel Pudlák, Samuel R. Buss
    Pages 151-162

  13. Monadic second-order logic and linear orderings of finite structures

    • Bruno Courcelle
    Pages 163-176

  14. First-order spectra with one binary predicate

    • Arnaud Durand, Solomampionona Ranaivoson
    Pages 177-189

  15. Monadic logical definability of NP-complete problems

    • Etienne Grandjean, Frédéric Olive
    Pages 190-204

  16. Logics for context-free languages

    • Clemens Lautemann, Thomas Schwentick, Denis Thérien
    Pages 205-216

  17. Log-approximable minimization problems on random inputs

    • Anders Malmström
    Pages 217-227

  18. Convergence and 0–1 laws for L k∞,ω under arbitrary measures

    • Monica McArthur
    Pages 228-241

  19. Is first order contained in an initial segment of PTIME?

    • Alexei P. Stolboushkin, Michael A. Taitslin
    Pages 242-248

  20. Logic programming in Tau Categories

    • Stacy E. Finkelstein, Peter Freyd, James Lipton
    Pages 249-263
Back to top

Other volumes

  1. Computer Science Logic

Keywords

About this book

This volume contains revised refereed versions of the best papers presented during the CSL '94 conference, held in Kazimierz, Poland in September 1994; CSL '94 is the eighth event in the series of workshops held for the third time as the Annual Conference of the European Association for Computer Science Logic.
The 38 papers presented were selected from a total of 151 submissions. All important aspects of the methods of mathematical logic in computer science are addressed: lambda calculus, proof theory, finite model theory, logic programming, semantics, category theory, and other logical systems. Together, these papers give a representative snapshot of the area of logical foundations of computer science.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation