No label defined (Q4460845)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2063228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2063228 |
Statements
29 March 2004
0 references
Curry-Howard isomorphism
0 references
Hoare logic
0 references
imperative programs
0 references
automated theorem proving
0 references
constructive type theory
0 references
program specification
0 references
0.8488287925720215
0 references
0.7975786328315735
0 references
0.7787451148033142
0 references
0.7530090808868408
0 references
0.7398050427436829
0 references
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].
0 references