Making "stricterness" more relevant

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. Categories and Subject Descriptors F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages—Program analysis; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs—Functional constructs, Type structure General Terms Languages, Theory Keywords lazy evaluation, strictness analysis...

• Type: Conference
• Year: 2010
• Where: PEPM
• Authors: Stefan Holdermans, Jurriaan Hage
• Keywords: Explicit Strictness Annotations, Keywords Lazy Evaluation, Lazy Programming Languages, PEPM 2010, Software Engineering