Efficient Verified Programs in a Type Theory with Mixed Constructivity (Q4849649)
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 802495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Verified Programs in a Type Theory with Mixed Constructivity |
scientific article; zbMATH DE number 802495 |
Statements
Efficient Verified Programs in a Type Theory with Mixed Constructivity (English)
0 references
4 October 1995
0 references
constructive type theory
0 references
verified programming
0 references
intuitionistic logic
0 references
mixed constructivity
0 references
evidence semantics
0 references
programming logic
0 references
typed \(\lambda\)-calculus
0 references
denotational semantics
0 references
0.90972304
0 references
0.9082732
0 references
0.90632284
0 references
0 references
0.89826405
0 references
0.8960371
0 references
