The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction (Q1595930)
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 1565457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction |
scientific article; zbMATH DE number 1565457 |
Statements
The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction (English)
0 references
18 February 2001
0 references
A-translation
0 references
constructive proofs
0 references
Dickson's lemma
0 references
realizability
0 references
program extraction
0 references
provably correct programs
0 references
Warshall algorithm
0 references
0.7934253811836243
0 references
0.7799196839332581
0 references
0.7663350105285645
0 references
