Skip to main content
Springer Nature Link
Account

Logics of Programs

Brooklyn, June 17-19, 1985

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. Rohit Parikh

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

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

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  2. Nonclausal temporal deduction

    • Martin Abadi, Zohar Manna
    Pages 1-15

  3. Unsolvable terms in typed lambda calculus with fix-point operators: Extended abstract

    • Irina Bercovici
    Pages 16-22

  4. Lambda calculus with constrained types

    • Val Breazu-Tannen, Albert R. Meyer
    Pages 23-40

  5. An axiomatic treatment of a parallel programming language

    • Stephen D. Brookes
    Pages 41-60

  6. Recursive definitions in type theory

    • R. L. Constable, N. P. Mendler
    Pages 61-78

  7. Errata

    Pages 78-78

  8. Automata, tableaux, and temporal logics

    • E. Allen Emerson
    Pages 79-88

  9. Proving termination of Prolog programs

    • Nissim Francez, Orna Grumberg, Shmuel Katz, Amir Pnueli
    Pages 89-105

  10. A Hoare Calculus for functions defined by recursion on higher types

    • Andreas Goerdt
    Pages 106-117

  11. On the relative incompleteness of logics for total correctness

    • MichaÅ‚ Grabowski
    Pages 118-127

  12. From synchronization tree logic to acceptance model logic

    • S. Graf, J. Sifakis
    Pages 128-142

  13. A FASE specification of FP

    • Sam Kamin
    Pages 143-152

  14. On asymptotic probabilities of inductive queries and their decision problem

    • Phokion G. Kolaitis
    Pages 153-166

  15. Compositional semantics for real-time distributed computing

    • R. Koymans, R. K. Shyamasundar, W. P. de Roever, R. Gerth, S. Arun-Kumar
    Pages 167-189

  16. Partial-correctness theories as first-order theories

    • Daniel Leviant
    Pages 190-195

  17. The glory of the past

    • Orna Lichtenstein, Amir Pnueli, Lenore Zuck
    Pages 196-218

  18. Continuation semantics in typed lambda-calculi

    • Albert R. Meyer, Mitchell Wand
    Pages 219-224

  19. Second-order logical relations

    • John C. Mitchell, Albert R. Meyer
    Pages 225-236

  20. Behavior: a temporal appreach to process modeling

    • Van Nguyen, Alan Demers, David Gries, Susan Owicki
    Pages 237-254
Back to top

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top