Skip to main content
SpringerLink
Log in

Proof and Computation

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Helmut Schwichtenberg

    1. Mathematisches Institut, Ludwig-Maximilians-Universität München, München, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: NATO ASI Subseries F: (NATO ASI F, volume 139)

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (11 papers)

  1. Front Matter

    Pages i-vii
    Download chapter PDF

  2. Program Development by Proof Transformation

    • Ulrich Berger, Helmut Schwichtenberg
    Pages 1-45

  3. Concurrent Processes and Petri Nets

    • Wilfried Brauer, Robert Gold
    Pages 47-108

  4. Using Reflection to Explain and Enhance Type Theory

    • Robert L. Constable
    Pages 109-144

  5. On Geometry of Interaction

    • Jean-Yves Girard
    Pages 145-191

  6. Behavioural Specifications

    • Rolf Hennicker, Martin Wirsing
    Pages 193-230

  7. A Deductive Approach to Logic Programming

    • Gerhard Jäger
    Pages 231-270

  8. Rewrite Proofs and Computations

    • Jean-Pierre Jouannaud
    Pages 271-316

  9. Action Structures and the Pi Calculus

    • Robin Milner
    Pages 317-377

  10. Linear Logic and Computation: A Survey

    • Andre Scedrov
    Pages 379-395

  11. Computable Functions on Stream Algebras

    • J. V. Tucker, J. I. Zucker
    Pages 397-437

  12. The Proof Theoretic Complexity of Recursive Programs

    • Stanley S. Wainer
    Pages 439-470
Back to top

Keywords

About this book

Logical concepts and methods are of growing importance in many areas of computer science. The proofs-as-programs paradigm and the wide acceptance of Prolog show this clearly. The logical notion of a formal proof in various constructive systems can be viewed as a very explicit way to describe a computation procedure. Also conversely, the development of logical systems has been influenced by accumulating knowledge on rewriting and unification techniques. This volume contains a series of lectures by leading researchers giving a presentation of new ideas on the impact of the concept of a formal proof on computation theory. The subjects covered are: specification and abstract data types, proving techniques, constructive methods, linear logic, and concurrency and logic.

Editors and Affiliations

  • Mathematisches Institut, Ludwig-Maximilians-Universität München, München, Germany

    Helmut Schwichtenberg

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation