Extraction of redundancy-free programs from constructive natural deduction proofs (Q808284)
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: Extraction of redundancy-free programs from constructive natural deduction proofs |
scientific article; zbMATH DE number 4209628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extraction of redundancy-free programs from constructive natural deduction proofs |
scientific article; zbMATH DE number 4209628 |
Statements
Extraction of redundancy-free programs from constructive natural deduction proofs (English)
0 references
1991
0 references
automated programming
0 references
program verification
0 references
redundancy-free codes
0 references
proof trees
0 references
realizability interpretation
0 references
constructive logic
0 references
0.8216356635093689
0 references
0.7672271132469177
0 references
0.7523461580276489
0 references
0.7494190335273743
0 references
