Strictness and Totality Analysis

Kirsten Lackner Solberg, Hanne Riis Nielson
1994 DAIMI Report Series  
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 only at "top level´´. We give examples of its use and
more » ... ove the correctness with respect to a natural-style operational semantics.
doi:10.7146/dpb.v23i474.6947 fatcat:htq5qhftsjdpbibohpsjg4fm4u