Skip to main content

A survey of some useful partial order relations on terms of the lambda calculus

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Barendregt, H.P., Some extensional term models for combinatory logics and λ-calculi, Utrecht 1971.

    Google Scholar 

  • Böhm, C., Alcune proprieta della forme βη-normali del λK-calcolo, C.N.R. No.696, Rome 1968.

    Google Scholar 

  • Hyland, J.M.E., A syntactic characterization of the equality in some models for the Lambda Calculus, to appear Bull. L.M.S. 1975.

    Google Scholar 

  • Scott, D., Continuous Lattices, Springer L.N.M. No.274, 97–136.

    Google Scholar 

  • Scott, D., Data Types as Lattices, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

C. Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hyland, J.M.E. (1975). A survey of some useful partial order relations on terms of the lambda calculus. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029520

Download citation

  • DOI: https://doi.org/10.1007/BFb0029520

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07416-8

  • Online ISBN: 978-3-540-37944-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics