Skip to main content

Formal representations for recursively defined functional programs

  • Communications
  • Conference paper
  • First Online:
Book cover Formalization of Programming Concepts (ICFPC 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 107))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. Church, A. The Calculi of Lambda-Conversion. Princeton University Press, Princeton, N.J., 1941.

    Google Scholar 

  3. Curry, H.B. and Feys, R. Combinatory Logic, Vol. 1. North-Holland Pub. Co., Amsterdam, 1958.

    Google Scholar 

  4. Kleene, S.C. Introduction to Metamathematics, Van Nostrand, New York, 1952.

    Google Scholar 

  5. McCarthy, J. "Recursive functions of symbolic expressions and their computation by machine, Part 1." CACM, April 1960.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Díaz I. Ramos

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Williams, J.H. (1981). Formal representations for recursively defined functional programs. In: Díaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-10699-5_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10699-9

  • Online ISBN: 978-3-540-38654-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics