Skip to main content
Article thumbnail
Location of Repository

Strictness analysis via abstract interpretation for recursively defined types

By G.R. Renardel de Lavalette


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

Topics: Wijsbegeerte, strictness analysis, functional language, recursive types, typed lambda calculus, abstract interpretation
Year: 1990
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.