Strictness analysis via abstract interpretation for recursively defined types
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 latticesSimilar works
Full text
Last time updated on 14/06/2016
This paper was published in Utrecht University Repository.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.