Strictness analysis via abstract interpretation for recursively defined types
Gerard R. Renardel de Lavalette · University of Groningen research database (University of Groningen / Centre for Information Technology) · 1990
In this paper we consider a functional language with recursively delined types and a weak form of polymorphism. For this language a strictness analysis is developed, based on abstract interpretation in a category of complete algebraic lattices.