Strictness Analysis via Resource Typing

Erik Barendsen
Institute for Computing and Information Sciences, Radboud University Nijmegen

Sjaak Smetsers
Institute for Computing and Information Sciences, Radboud University Nijmegen

Abstract

We present a new typing system for strictness analysis of functional programs. The system extends standard typing (including recursive data types) with strictness annotations and subtyping. Strictness typing is shown to be sound with respect to a natural operational semantics. We demonstrate that strictness types can be computed effectively.

Full text

PDF