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.

• Type: Conference
• Year: 1994
• Where: SAS
• Authors: Kirsten Lackner Solberg
• Keywords: Evaluate, Formal Methods, Natural-style Operational Semantics, SAS 1994, Simplytyped Lazy Lambda-calculus