Advertisement

Formal representations for recursively defined functional programs

  • John H. Williams
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 107)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ba 78]
    Backus, J.W. "Can programming be liberated from the von Neumann style? A functional style and its algebra of programs." CACM, August 1978.Google Scholar
  2. [Ch 41]
    Church, A. The Calculi of Lambda-Conversion. Princeton University Press, Princeton, N.J., 1941.Google Scholar
  3. [Cu 58]
    Curry, H.B. and Feys, R. Combinatory Logic, Vol. 1. North-Holland Pub. Co., Amsterdam, 1958.Google Scholar
  4. [Kl 52]
    Kleene, S.C. Introduction to Metamathematics, Van Nostrand, New York, 1952.Google Scholar
  5. [Mc 60]
    McCarthy, J. "Recursive functions of symbolic expressions and their computation by machine, Part 1." CACM, April 1960.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • John H. Williams
    • 1
  1. 1.IBM Research LaboratorySan Jose

Personalised recommendations