Abstract
Strictness analysis detects when it is safe to evaluate expressions before they actually need to be evaluated in a lazy language. We present the development of a polyvariant strictness analysis for Haskell. Previous developments typically used an ad hoc lambda-calculus based language that do not always reflect Haskell's complexity entirely,
... read more