论文信息 - The Theory and Practice of Transforming Call-by-need into Call-by-value

The Theory and Practice of Transforming Call-by-need into Call-by-value

Call-by-need (which is an equivalent but more efficient implementation of call-by-name for applicative languages) is quite expensive with current hardware and also does not permit full use of the tricks (such as memo functions and recursion removal) associated with the cheaper call-by-value. However the latter mechanism may fail to terminate for perfectly well-defined equations and also invalidates some program transformation schemata.

Alan Mycroft | A. Mycroft

[1] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[2] Jean Vuillemin. Correct and Optimal Implementations of Recursion in a Simple Programming Language , 1974, J. Comput. Syst. Sci..

[3] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[4] J. Vuillemin. Proof techniques for recursive programs , 1973 .

[5] Robin Milner,et al. A Metalanguage for interactive proof in LCF , 1978, POPL.

[6] Bernard Lang,et al. Threshold evaluation and the semantics of call by value, assignment and generic procedures , 1977, POPL.

[7] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.