The greatest common divisor: A case study for program extraction from classical proofs (Q4647568)
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 7002043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The greatest common divisor: A case study for program extraction from classical proofs |
scientific article; zbMATH DE number 7002043 |
Statements
The greatest common divisor: A case study for program extraction from classical proofs (English)
0 references
15 January 2019
0 references
