Abstract
The input-output behaviour of recursive program schemes with parameters called-by-name is expressed as a non-deterministic choice between calls of recursive program schemes with parameters called-by-value, and can therefore be expressed within first-order predicate logic extended with least fixed point operators.
The research reported in this paper has been carried out both at the Mathematisch Centrum, Amsterdam, and at the Programming Research Group, Oxford; the research in Oxford is made possible by a grant from the Netherlands Organization for the Advancement of Pure Research (Z.W.O.).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cadiou, J.M., Recursive definitions of partial functions and their computations, Ph.D. Thesis, Computer Science Department, Stanford University (1973).
Hitchcock, P. & D. Park, Induction rules and proofs of termination, in: Proc. IRIA Symposium on Automata, Formal Languages and Programming, M. Nivat (ed.), North-Holland (1972).
Manna, Z. & J. M. Cadiou, Recursive definitions of partial functions and their computations, in: Proc. of an ACM Conference on Proving Assertions about Programs, Las Cruces, New Mexico (1972).
Manna, Z. & A. Pnueli, Formalization of properties of functional programs, J. ACM, 17 (1970) 555–569.
Park, D. Fixpoint induction and proofs of program semantics, in: Machine Intelligence, Vol. 5, pp. 59–70. B. Meltzer and D. Michie. (eds.), Edinburgh University Press, Edinburgh (1970).
de Roever, W.P., Recursion and parameter mechanisms: an axiomatic approach, in: Automata, Languages and Programming, 2nd Colloquium, University of Saarbrucken, edited by J. Loeckx, Lecture Notes in Computer Science no.14, Springer Verlag, Berlin, etc. (1974).
de Roever, W.P., Call-by-value versus call-by-name: a proof-theoretic comparison, in Proc. of the Third Symposium and Summer School on "Mathematical Foundations of Computer Science", Jadwisin, Lecture Notes in Computer Science, Springer Verlag, Berlin, etc. (1975).
de Roever, W.P., Recursive program schemes: semantics and proof theory, dissertation, Math. Centrum, Amsterdam, (1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Roever, W.P. (1975). First-order reduction of call-by-name to call-by-value. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_223
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_223
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive