Abstract

Abstract. By “thunkifying ” the arguments to function applications and “dethunkifying ” variables one can translate a λ-expression e into a λ-expression e ′ , such that call-by-value evaluation of e ′ gives the same result as call-by-name evaluation of e. By using the result of a strictness analysis, some of these thunkifications can be avoided. In this paper we present a type system for strictness analysis; present a translation algorithm which exploits the strictness proof tree; and give a combined proof of the correctness of the analysis/translation. 1

Citations

265	Why functional programming matters - Hughes - 1989
69	Strictness analysis for higher-order functions - Burn, Hankin, et al. - 1986
53	Strictness Analysis: A New Perspective Based on Type Inference - Tsung-Min, Mishra - 1989
42	Strictness Analysis in Logical Form - Jensen - 1991
36	Specifying the Correctness of Binding-time Analysis - Wand - 1993
26	CPS transformation after strictness analysis - Danvy, Hatcliff
21	A new technique for strictness analysis - Wright - 1991
5	Context information for lazy code generation - Nielson, Nielson - 1990
3	Strictness types: An inference algorithm and an application - Amtoft - 1993
3	The correctness of an optimized code generation - Lange - 1992
3	The theory of transforming call-by-need to call-by-value - Mycroft - 1980
2	An intensional type discipline. Australian Computer Science Communications - Wright - 1992
1	An intensional type discipline - Wright