Abstract
In this paper we define the functional language POLYREC with
polymorphic and recursive types, and develop concrete and abstract
interpretations for this language. These semantics, based on
complete partial orderings and complete lattices, are subsequently
used for definition and analysis of strictness.
