Strictness analysis via abstract interpretation for recursively defined types (Q1193597)
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: Strictness analysis via abstract interpretation for recursively defined types |
scientific article; zbMATH DE number 64878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strictness analysis via abstract interpretation for recursively defined types |
scientific article; zbMATH DE number 64878 |
Statements
Strictness analysis via abstract interpretation for recursively defined types (English)
0 references
27 September 1992
0 references
analysis of lazy
0 references
functional programs
0 references
static analysis of programs
0 references
type verification
0 references
program correctness
0 references
termination
0 references
0 references
0.9458612
0 references
0.93923044
0 references
0.89693403
0 references
0.89635956
0 references
0.8928266
0 references
0.8914778
0 references
