Finiteness Conditions for Strictness Analysis

Authors

  • Flemming Nielson
  • Hanne Riis Nielson

DOI:

https://doi.org/10.7146/dpb.v22i447.6764

Abstract

We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler's method for analysing lists. Limitations of the method are indicated.

Author Biographies

Flemming Nielson

Hanne Riis Nielson

Downloads

Published

1993-07-01

How to Cite

Nielson, F., & Nielson, H. R. (1993). Finiteness Conditions for Strictness Analysis. DAIMI Report Series, 22(447). https://doi.org/10.7146/dpb.v22i447.6764

Issue

No. 447 (1993): Pb-447 Finiteness Conditions for Strictness Analysis

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.