Proofs and programs: A naïve approach to program extraction (Q912594): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:09, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proofs and programs: A naïve approach to program extraction |
scientific article |
Statements
Proofs and programs: A naïve approach to program extraction (English)
0 references
1989
0 references
It is shown how to extract while-programs from proofs of their specifications in a (non-constructive) many-sorted predicate logic with partial terms. The author compares his system to different systems of automatic program synthesis from specifications.
0 references
while-programs
0 references
many-sorted predicate logic
0 references
automatic program synthesis from specifications
0 references
