scientific article; zbMATH DE number 2063228
A constructive version of a Hoare logic for reasoning about imperative programs to which the Curry-Howard isomorphism may be adapted is presented. The Curry-Howard isomorphism permits the representation of intuitionistic logic as a constructive type theory and it can be exploited in the implementation of interactive theorem provers. Theorems of the logic consist of an imperative ML program and a formula that describes the program's side-effects by means of pre- and post-conditions. The logic uses natural deduction and therefore the calculus can be understood as a constructive type theory where proofs correspond to terms and formulae to types. An extraction map from proof=terms of this type theory to programs (in SML) is given. This enables SML programs to be synthesized from proofs of their specifications. For the entire collection see [Zbl 1030.03004].
- Adapting proofs-as-programs. The Curry-Howard protocol.
- Synthesis of functional programs with help of first-order intuitionistic logic
- Proofs-as-imperative-programs: application to synthesis of contracts
- Lectures on the Curry-Howard isomorphism
- A Curry-Howard isomorphism for compilation and program execution. (Extended abstract)
- Typing in reflective combinatory logic
- Variations on a theme of Curry
- iRho: an imperative rewriting calculus
- A Curry-Howard isomorphism for compilation and program execution. (Extended abstract)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
- Synthesis of functional programs with help of first-order intuitionistic logic
- Adapting proofs-as-programs. The Curry-Howard protocol.
- Proofs-as-imperative-programs: application to synthesis of contracts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4460845)