Higher-Order and Symbolic Computation

, Volume 23, Issue 3, pp 315–335

Making “stricterness” more relevant

Open AccessArticle

DOI: 10.1007/s10990-011-9079-7

Cite this article as:
Holdermans, S. & Hage, J. Higher-Order Symb Comput (2010) 23: 315. doi:10.1007/s10990-011-9079-7


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.


Lazy evaluationStrictness analysisRelevance typingExplicit strictness annotationsFunctional languagesType and effect systems
Download to read the full article text

Copyright information

© The Author(s) 2011

Authors and Affiliations

  1. 1.Vector FabricsEindhovenThe Netherlands
  2. 2.Department of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands