Adapting proofs-as-programs. The Curry-Howard protocol.
The proof-as-programs paradigm constitutes a set of approaches to developing programs from proofs in constructive logic. These methods use constructive, intuitionistic logic and the Curry-Howard isomorphism to generate programs from proofs of their specifications in two different contexts: proofs-as-imperative-programs and structured proofs-as-programs. The Curry-Howard isomorphism says that intuitionistic logic can be represented by a type theory where proofs correspond to terms, formulae to types, logical rules to type inference and proof normalization to term simplification. In order to represent intuitionistic proofs, terms contain constructive information used to prove formulae. This information can be used to syntesize correct programs from proofs. This idea is referred to as the proofs-as-programs paradigm. The book is organized into 6 parts and 12 chapters: Part I is the introductory chapter. Part II introduces the Curry-Howard protocol and provides an example for the synthesis of functional programs. Part III defines a method for imperative program synthesis: it defines a logical type theory and some necessary properties of this logic. In this respect it reviews properties of intuitionistic Hoare logic and presents some examples such as: an electronic banking system and synthesis of contracts. Part IV develops a method for reasoning about structured specifications and synthesis of functions in the frame of a structured specification logic. The examples offered are: password checking system and warehouse specification. Part V offers concluding remarks and suggests directions for future research. Part VI is an appendix about constructive logic. This monograph serves the dual purpose of providing a state-of-the-art overview of the field and detailing tools and techniques to stimulate further research. It can serve as material for graduate students in computer science or mathematics, the proofs-as-programs research community and the computational logic, formal methods and software engineering communities.
- Proofs-as-imperative-programs: application to synthesis of contracts
- scientific article; zbMATH DE number 2063228
- Synthesis of Data Views for Communicating Processes
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Protocols between programs and proofs
- Programming in Ωmega
- Protocols between programs and proofs
- scientific article; zbMATH DE number 2063228 (Why is no real title available?)
- … and so on: Schütte on Naming Ordinals
- A homage to Martin Wirsing
- Ode to the PST
- Synthesis of functional programs with help of first-order intuitionistic logic
- Synthesis of Data Views for Communicating Processes
- Proofs-as-imperative-programs: application to synthesis of contracts
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
This page was built for publication: Adapting proofs-as-programs. The Curry-Howard protocol.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693641)