Skip to main content
SpringerLink
Log in

Continuous semantics and inside-out reductions

  • Conference paper
  • First Online:
λ-Calculus and Computer Science Theory (LCCST 1975)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt,H.P.: “Some Extensional Term Models for Combinatory Logics and λ-Calculi”: Ph.D. Thesis, Utrecht (1971).

    Google Scholar 

  2. Curry,H.B., Feys,R.: “Combinatory Logic — Volume I”: North-Holland, Amsterdam (1958).

    Google Scholar 

  3. Lévy,J-J.: “Another Syntactic Model of the λ-κ-β-Calculus”: Symposium on λ-Calculus and Computer Sciences Theory, Roma (1975)

    Google Scholar 

  4. Lévy,J-J.: “Réductions Sures dans le Lambda-Calcul”: Diplome de Docteur de 3e Cycle, Universite Paris VII (1974).

    Google Scholar 

  5. Park,D.M.R.: “The Y-Combinator in Scott's Lambda-Calculus Models”: Unpublished notes, University of Warwick (1970).

    Google Scholar 

  6. Reynolds,J.C.: “Notes on a Lattice-Theoretic Approach to the Theory of Computation”: Systems and Information Science, Syracuse University (1972).

    Google Scholar 

  7. Scott,D.: “Continuous Lattices”: Technical Monograph PRG-7, Oxford University Computing Laboratory, Programming Research Group (1970).

    Google Scholar 

  8. Scott,D.: “Data Types as Lattices”: Unpublished lecture notes, Oxford (1973).

    Google Scholar 

  9. Scott,D.: “The Lattice of Flow Diagrams”: PRG-3 (1970).

    Google Scholar 

  10. Wadsworth,C.P.: “Semantics and Pragmatics of the λ-Calculus”: Ph.D. Thesis, Oxford University (1971).

    Google Scholar 

  11. Wadsworth,C.P.: “Typed λ-Expressions”: Unpublished notes, Oxford (1972).

    Google Scholar 

  12. Welch,P.H.: “The Minimal Continuous Semantics of the Lambda-Calculus”: Ph.D. Thesis (Submitted), Warwick University (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, Cornwallis Building, The University, CT2 7NF, Canterbury, Kent, England

    P. H. Welch

Authors
  1. P. H. Welch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Welch, P.H. (1975). Continuous semantics and inside-out reductions. 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/BFb0029522

Download citation

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

  • 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

Search

Navigation