The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction (Q1595930): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1026748613865 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1772256284 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction |
scientific article |
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
