Strictness analysis via abstract interpretation for recursively defined types
Publication date
1990-10
Authors
Renardel de Lavalette, G.R.
Editors
Advisors
Supervisors
DOI
Document Type
Preprint
Metadata
Show full item recordCollections
License
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.
Keywords
strictness analysis, functional language, recursive types, typed lambda calculus, abstract interpretation