Advertisement

First-order reduction of call-by-name to call-by-value

  • Willem P. de Roever
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cadiou, J.M., Recursive definitions of partial functions and their computations, Ph.D. Thesis, Computer Science Department, Stanford University (1973).Google Scholar
  2. 2.
    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).Google Scholar
  3. 3.
    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).Google Scholar
  4. 4.
    Manna, Z. & A. Pnueli, Formalization of properties of functional programs, J. ACM, 17 (1970) 555–569.CrossRefGoogle Scholar
  5. 5.
    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).Google Scholar
  6. 6.
    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).Google Scholar
  7. 7.
    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).Google Scholar
  8. 8.
    de Roever, W.P., Recursive program schemes: semantics and proof theory, dissertation, Math. Centrum, Amsterdam, (1975).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Willem P. de Roever
    • 1
  1. 1.Programming Research GroupOxford University Computing LaboratoryOxfordEngland

Personalised recommendations