Open AccessFiniteness Conditions for Strictness Analysis
Author(s) -
Flemming Nielson,
Hanne Riis Nielson
Publication year - 1993
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v22i447.6764
Subject(s) - syntax , computer science , operator (biology) , point (geometry) , functional programming , theoretical computer science , programming language , linguistics , mathematics , natural language processing , philosophy , biochemistry , chemistry , geometry , repressor , transcription factor , gene
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.