Proofs and programs: A naïve approach to program extraction (Q912594): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.2977/prims/1195173352 / rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Nuprl / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2977/prims/1195173352 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W363624716 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3882452 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An axiomatic basis for computer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3744159 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Deductive Approach to Program Synthesis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A logical basis for programming methodology / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.2977/PRIMS/1195173352 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:12, 10 December 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
