Sciweavers

Share
SAS
1994
Springer

Strictness and Totality Analysis

10 years 7 months ago
Strictness and Totality Analysis
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped 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 only at "top-level". We give examples of its use and prove the correctness with respect to a natural-style operational semantics.
Kirsten Lackner Solberg
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1994
Where SAS
Authors Kirsten Lackner Solberg
Comments (0)
books