Effective strictness analysis with HORN constraints

Kevin Glynn, Peter J. Stuckey, Martin Sulzmann

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)


We introduce a constraint-based framework for strictness analysis applicable to ML style languages supporting higher-order functions, let-style polymorphism and algebraic data types. The analysis produces strictness types for expressions in a program. A strictness type is defined using Boolean constraints. Perhaps surprisingly, the Boolean constraints that arise during analysis are in HORN, which makes the operations on them amenable to efficient implementation. We have implemented the approach within a highly optimising Haskell compiler (GHC) and give a comparison with the current strictness analyser of GHC.

Original languageEnglish
Title of host publicationStatic Analysis - 8th International Symposium, SAS 2001, Proceedings
Number of pages20
Publication statusPublished - 1 Dec 2001
Externally publishedYes
EventStatic Analysis Symposium 2001 - Paris, France
Duration: 16 Jul 200118 Jul 2001
Conference number: 8th
https://link.springer.com/book/10.1007/3-540-47764-0 (Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2126 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceStatic Analysis Symposium 2001
Abbreviated titleSAS 2001
Internet address

Cite this