Strictness analysis for POLYREC, a language with polymorphic and recursive types
Publication date
1988-03
Authors
Renardel de Lavalette, G.R.
Editors
Advisors
Supervisors
DOI
Document Type
Preprint
Metadata
Show full item recordCollections
License
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.
Keywords
strictness analysis,, functional, language, recursive types, polymorphic lambda calculus, abstract -interpretation