Abstract
In this paper we consider a functional language with recursively
defined types and a weak form of polymorphism. For this
language strictness analysis is developed, based on abstract
interpretation in a category of complete algebraic lattices.
