Semantics of Data Types pp 131-144 | Cite as

# The semantics of second order polymorphic lambda calculus

Conference paper

First Online:

## Keywords

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.

## Preview

Unable to display preview. Download preview PDF.

## Bibliography

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