𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Proof and Computation

✍ Scribed by Ulrich Berger, Helmut Schwichtenberg (auth.), Helmut Schwichtenberg (eds.)


Publisher
Springer-Verlag Berlin Heidelberg
Year
1995
Tongue
English
Leaves
477
Series
NATO ASI Series 139
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.

✦ Table of Contents


Front Matter....Pages i-vii
Program Development by Proof Transformation....Pages 1-45
Concurrent Processes and Petri Nets....Pages 47-108
Using Reflection to Explain and Enhance Type Theory....Pages 109-144
On Geometry of Interaction....Pages 145-191
Behavioural Specifications....Pages 193-230
A Deductive Approach to Logic Programming....Pages 231-270
Rewrite Proofs and Computations....Pages 271-316
Action Structures and the Pi Calculus....Pages 317-377
Linear Logic and Computation: A Survey....Pages 379-395
Computable Functions on Stream Algebras....Pages 397-437
The Proof Theoretic Complexity of Recursive Programs....Pages 439-470

✦ Subjects


Logic Design; Computer Communication Networks; Programming Techniques; Software Engineering; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs


πŸ“œ SIMILAR VOLUMES


Proofs and Computations
✍ Helmut Schwichtenberg, Stanley S. Wainer πŸ“‚ Library πŸ“… 2012 πŸ› Cambridge University Press 🌐 English

Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I cover

Proofs and Computations
✍ Helmut Schwichtenberg, Stanley S. Wainer πŸ“‚ Library πŸ“… 2012 πŸ› Cambridge University Press 🌐 English
Proofs and Computations
✍ Helmut Schwichtenberg, Stanley S. Wainer πŸ“‚ Library πŸ“… 2012 πŸ› Cambridge University Press 🌐 English
Computation and Proof Theory
✍ Richter M.M. (ed.), Borger E. (ed.), Oberschelp W. (ed.) πŸ“‚ Library πŸ“… 1984 🌐 English

Lecture notes in mathematics No.1104

Mathesis Universalis, Computability and
✍ Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster πŸ“‚ Library πŸ“… 2019 πŸ› Springer International Publishing 🌐 English

<p><p>In a fragment entitled <i>Elementa Nova Matheseos Universalis </i>(1683?) Leibniz writes β€œthe <i>mathesis </i>[…]<i></i>shall deliver the method through which things that are conceivable can be exactly determined”; in another fragment he takes the <i>mathesis </i>to be β€œthe science of all thin

Proof and Computation: Digitization in M
✍ Klaus Mainzer, Peter Schuster, Helmut Schwichtenberg πŸ“‚ Library πŸ“… 2018 πŸ› World Scientific Publishing 🌐 English

<span><p>This book is for graduate students and researchers, introducing modern foundational research in mathematics, computer science, and philosophy from an interdisciplinary point of view. Its scope includes Predicative Foundations, Constructive Mathematics and Type Theory, Computation in Higher