Journal article ยท Conference paper
Strictness and Totality Analysis
We define a novel inference system for strictness and totality analysis for the simply-typed lazy lambda-calculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms that definitely do not denote bottom (i.e. do evaluate to WHNF).
The analysis is presented as an annotated type system allowing conjunctions at ?top-level? only. We give examples of its use and prove the correctness with respect to a natural-style operational semantics.
Language: | English |
---|---|
Year: | 1998 |
Pages: | 113-145 |
Proceedings: | 1st International Static Analysis Symposium |
ISSN: | 18727964 and 01676423 |
Types: | Journal article and Conference paper |
DOI: | 10.1016/S0167-6423(96)00043-3 |
ORCIDs: | Nielson, Hanne Riis and Nielson, Flemming |