Ebook: Proof and Computation

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.

---

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.

---

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.
Content:
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

---

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.
Content:
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
....