Adapting Proofs-as-Programs - Iman Poernomo, John N. Crossley, Martin Wirsing

Adapting Proofs-as-Programs

The Curry--Howard Protocol
Buch | Softcover
420 Seiten
2010 | Softcover reprint of hardcover 1st ed. 2005
Springer-Verlag New York Inc.
978-1-4419-2014-0 (ISBN)
176,54 inkl. MwSt
This book ?nds new things to do with an old idea. The proofs-as-programs paradigm constitutes a set of approaches to developing programs from proofs in constructive logic. It has been over thirty years since the paradigm was ?rst conceived. At that time, there was a belief that proofs-as-programs had the - tential for practical application to semi-automated software development. I- tial applications were mostly concerned with ?ne-grain, mathematical program synthesis. For various reasons, research interest in the area eventually tended toward more theoretic issues of constructive logic and type theory. However, in recent years, the situation has become more balanced, and there is increasingly active research in applying constructive techniques to industrial-scale, complex software engineering problems. Thismonographdetailsseveralimportantadvancesinthisdirectionofpr- tical proofs-as-programs. One of the central themes of the book is a general, abstract framework for developing new systems of program synthesis by adapting proofs-as-programs to new contexts. Framework-oriented approaches that facilitate analogous - proaches to building systems for solving particular problems have been popular and successful. Thesemethodsarehelpful asthey providea formal toolbox that enablesa“roll-your-own”approachtodevelopingsolutions.Itishopedthatour framework will have a similar impact. The framework is demonstrated by example. We will give two novel - plications of proofs-as-programs to large-scale, coarse-grain software engine- ing problems: contractual imperative program synthesis and structured p- gram synthesis. These applications constitute an exemplary justi?cation of the framework. Also, in and of themselves, these approaches to synthesis should be interesting forresearchers working in the target problem domains.

Prologue.- Generalizing Proofs-as-Programs.- Functional Program Synthesis.- The Curry-Howard Protocol.- Imperative Proofs-as-Programs.- Intuitionistic Hoare Logic.- Properties of Intuitionistic Hoare Logic.- Proofs-as-Imperative-Programs.- Structured Proofs-as-Programs.- Reasoning about Structured Specifications.- Proof-theoretic Properties of SSL.- Structured Proofs-as-Programs.- Generic Specifications.- Structured Program Synthesis.- Epilogue.- Conclusions: Toward Constructive Logic as a Practical 4GL.

Erscheint lt. Verlag 19.11.2010
Reihe/Serie Monographs in Computer Science
Zusatzinfo 54 Illustrations, black and white; XII, 420 p. 54 illus.
Verlagsort New York, NY
Sprache englisch
Maße 155 x 235 mm
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Allgemeines / Lexika
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 1-4419-2014-5 / 1441920145
ISBN-13 978-1-4419-2014-0 / 9781441920140
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Deterministische und randomisierte Algorithmen

von Volker Turau; Christoph Weyer

Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
64,95
Programmieren erlernen und technische Fragestellungen lösen

von Harald Nahrstedt

Buch | Softcover (2023)
Springer Vieweg (Verlag)
44,99