Least fixed points revisited
Parameter mechanisms for recursive procedures are investigated. Contrary to the view of Manna et al., it is argued that both call-by-value and call-by-name mechanisms yield the least fixed points of the functionals determined by the bodies of the procedures concerned. These functionals differ, however, according to the mechanism chosen. A careful and detailed presentation of this result is given, along the lines of a simple typed lambda calculus, with interpretation rules modelling program execution in such a way that call-by-value determines a change in the environment and call-by-name a textual substitution in the procedure body.
|Call-by-name, Call-by-value, Lambda calculus, Least fixed points, Mechanisms, Parameter, Recursion, Semantics|
|Symposium: λ-Calculus and Computer Science Theory|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
de Bakker, J.W. (1975). Least fixed points revisited. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 27–61). doi:10.1007/BFb0029518