Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typing are likely to either be unsafe or fail to pick the fruits of increases in strictness that are introduced through annotations. We propose a more involved adaptation of relevance typing, that can be used to derive strictness analyses that are both safe and effective in the presence of explicit strictness annotations. The resulting type system provides a firm foundation for implementations of type-based strictness analysers in compilers for lazy programming languages such as Haskell and Clean.
|Title of host publication||Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation|
|Subtitle of host publication||PEPM '10|
|Publisher||Association for Computing Machinery|
|Number of pages||10|
|Publication status||Published - 18 Jan 2010|