Order-of-demand analysis for lazy languages

Young G. Park, Benjamin Goldberg

Research output: Contribution to journalArticlepeer-review


This paper presents a method for statically inferring a range of information including strictness, evaluation-order, and evaluation-status information in a higher-order polymorphically-typed lazy functional language. This method is based on a compile-time analysis called order-of-demand analysis, which provides safe information about the order in which the values of bound variables are demanded. The time complexity of the analysis is substantially less than that of other approaches such as path analysis [5] and compositional analysis [7] and comparable to that of strictness analysis.

Original languageEnglish (US)
Pages (from-to)343-348
Number of pages6
JournalInformation Processing Letters
Issue number6
StatePublished - Sep 29 1995


  • Applicative programming
  • Compilers
  • Design of algorithms
  • Formal semantics
  • Functional programming
  • Language processors
  • Programming languages

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Order-of-demand analysis for lazy languages'. Together they form a unique fingerprint.

Cite this