The semantics of second order polymorphic lambda calculus

  • Kim B. Bruce
  • Albert R. Meyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 173)


Order Model Free Variable Completeness Theorem Type Expression Denotational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Barendregt, H.P. (1977). "The Type free lambda calculus," Handbook of Mathematical Logic, J. Barwise, ed., North Holland, New York, 1091–1132.Google Scholar
  2. Barendregt, H., Coppo, M., and Dezani-Ciancaglini, M. (1982). "A filter lambda model and the completeness of type assignment," preprint.Google Scholar
  3. Berry, G. (1980). "On the definition of lambda-calculus models," INRIA Rapports de Recherche, No. 46, 12 pp.Google Scholar
  4. Bruce, K., and G. Longo. (1984). "An elementary approach to the solution of recursive domain equations," preprint.Google Scholar
  5. Donahue, James (1979). "On the semantics of "data type," SIAM J. Computing 8, 546–560.Google Scholar
  6. Fortune, S., D. Leivant, and M. O'Donnell (1983). "The expressiveness of simple and second-order type structures," JACM, 30, 151–185.Google Scholar
  7. Girard, J.-Y. (1972). "Interpretation fonctionelle et elimination des coupures dans l'arithemetique d'order superieur," Ph.D. Dissertation, Paris.Google Scholar
  8. Haynes, C. (1982). "A Theory of data type representation independence," Ph.D. Dissertation, University of Iowa, Iowa City, Iowa.Google Scholar
  9. Hindley, R., and G. Longo (1980). "Lambda-calculus models and extensionality," Zeit. f. Math. Logik u. Grund. der Math. 26, 289–310.Google Scholar
  10. Koymans, K. (1982). "Models of the γ-calculus," Information and Control, 52, 306–332.Google Scholar
  11. Leivant, D. (1983a). "Polymorphic Type Inference," POPL Proceedings, pp. 88–98.Google Scholar
  12. __________(1983b). "Structural Semantics for Polymorphic Data Types," POPL Proceedings, pp. 155–166.Google Scholar
  13. MacQueen, D., and Sethi, R. (1982). "A semantic model of types for applicative languages," preprint.Google Scholar
  14. McCracken, N.J. (1979). "An investigation of a programming language with a polymorphic type structure," Ph.D. dissertation, Syracuse University.Google Scholar
  15. __________(1984). "A finitary retract model for the polymorphic lambda-calculus," to appear, Information and Control.Google Scholar
  16. Meyer, A. (1982). "What is a model of γ-calculus?", Information and Control, 12, 87–122.Google Scholar
  17. Milner, R. (1978). "A theory of type polymorphism in programming," JCSS 17, pp. 348–375.Google Scholar
  18. Mitchell, J. (1984). Personal communication.Google Scholar
  19. Reynolds, J.C. (1974). "Towards a theory of type structure," Colloquium on Programming, Paris.Google Scholar
  20. __________(1983). "Types, abstraction, and parametric polymorphism," preprint of paper delivered at IFIP Congress '83, 11 pp.Google Scholar
  21. Scott, D.S. (1976). "Data types as lattices," SIAM J. on Computing, 5, 522–587.Google Scholar
  22. — (1980a). "Lambda calculus: some models, some philosophy," The Kleene Symposium, Barwise et. al, ed., Studies on Logic 101, North Holland, New York, 381–421.Google Scholar
  23. — (1980b). "A space of retracts," manuscript, Merton College, Oxford.Google Scholar
  24. Statman, R. (1981). "Number theoretic functions computable by polymophic programs," in Twenty-Second Annual Symposium on Foundations of Computer Science, 279–282.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Kim B. Bruce
    • 1
  • Albert R. Meyer
    • 2
  1. 1.Department of Mathematical SciencesWilliams CollegeWilliamstownU.S.A.
  2. 2.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridgeU.S.A.

Personalised recommendations