Taming Selective Strictness

11 years 4 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functional programming languages, they can be used with very few preconditions. Unfortunately, in the presence of selective strictness, as provided in languages like Haskell, their original strength is reduced. In this paper we present an approach for restrengthening them. By a refined type system which tracks the use of strict evaluation, we rule out unnecessary restrictions that otherwise emerge from the general suspicion that strict evaluation may be used at any point. Additionally, we provide an implemented algorithm determining all refined types for a given term.
Daniel Seidel, Janis Voigtländer
Added 24 Jul 2010
Updated 24 Jul 2010
Type Conference
Year 2009
Where GI
Authors Daniel Seidel, Janis Voigtländer
Comments (0)