Writing constructive proofs yielding efficient extracted programs (Q2703717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Writing constructive proofs yielding efficient extracted programs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Writing constructive proofs yielding efficient extracted programs |
scientific article |
Statements
7 May 2001
0 references
Myhill-Nerode automata minimization theorem
0 references
Nuprl automata library
0 references
Writing constructive proofs yielding efficient extracted programs (English)
0 references
