Skip to main content

An interval model for second order lambda calculus

  • Conference paper
  • First Online:

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

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.

7. References

  • Amadio, R., Bruce, K., Longo, G. [1986] “The Finitary Projection Model and the solution of higher order domain equations”, Proceedings LICS 86, IEEE (pp.122–130).

    Google Scholar 

  • Barendregt, H. [1984], The lambda calculus; its syntax and semantics, Revised edition, North Holland.

    Google Scholar 

  • Bruce K., Meyer A. [1984] “The semantics of second order polymorphic lambda-calculus”, Symposium on Semantics of Data Types (Kahn, MacQueen, Plotkin eds.), LNCS 173, Springer-Verlag (pp. 131–144).

    Google Scholar 

  • Bruce, K., Meyer, A., Mitchell, J. [1985] “The semantics of second order lambda-calculus”, Information and Control (to appear).

    Google Scholar 

  • Cardelli, L. [1985] “Semantics of multiple inheritance”, Information and Control (to appear).

    Google Scholar 

  • Cardelli, L., Wegner, P. [1985] “On understanding types, data abstraction and polymorphism”, Computing Surveys, vol 17(4) (pp. 471–522).

    Google Scholar 

  • Cartwright R. [1984] “Types as Intervals”, Proc. Popl 84, ACM.

    Google Scholar 

  • Di Gianantonio, P. [1987] “The subtype relation in the interval model” (in italian), Master Thesis, Dip. di Informatica, Univ. di Pisa.

    Google Scholar 

  • Girard, J.-Y. [1985] “The system F of variable types, fifteen years later”, Theor. Comp. Sc. (to appear).

    Google Scholar 

  • Hayashi, S. [1985] “Adjunction of semifunctors: categorical structures in no-extensional lambda calculus”, Theor. Comp. Sc.,vol 41(1) (pp. 95–104).

    Google Scholar 

  • Kainen, P.C. [1971] “Weak adjoint functors”, Math. Z. 122 (pp.1–9).

    Google Scholar 

  • Longo, G. [1987] “On Church's formal theory of (computable) functions”, Church Thesis Conference Proceedings, Annals Pure App. Logic (to appear).

    Google Scholar 

  • MacQueen D., Plotkin G., Sethi R. [1986] “An ideal model for recursive polymorphic types”,Information and Control, vol 71(1–2) (pp.95–130).

    Google Scholar 

  • Martini, S. [1986] “Categorical models for typed and type-free non-extensional lambda-calculus”, preprint, Pisa.

    Google Scholar 

  • McCracken N. [1984] “A finitary retract model for the polymorphic lambda-calculus,” Information and Control (to appear).

    Google Scholar 

  • Meyer, A., Mitchell J.C., Moggi E., Statman R. [1987] “Empty types in polymorphic lambda calculus”, (ACM Conference on) POPL '87, Münich.

    Google Scholar 

  • Scott, D. [1980] “A space of retracts”, manuscript, Bremen.

    Google Scholar 

  • Wiweger A. [1984] “Pre-adjunction and λ-algebraic theories”, in Colloq. Math. 48(2), 153–165.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

David H. Pitt Axel Poigné David E. Rydeheard

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martini, S. (1987). An interval model for second order lambda calculus. In: Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. Lecture Notes in Computer Science, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18508-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-18508-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18508-6

  • Online ISBN: 978-3-540-48006-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics