A simple semantics for ML polymorphism

Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture, FPCA 1989

Volumn , Issue , 1989, Pages 281-292

  Ohori, Atsushi ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; POLYMORPHISM; SEMANTICS;

COMPLETENESS THEOREMS; DENOTATIONAL SEMANTICS; EQUATIONAL THEORY; EXTENDED LANGUAGES; ML-LIKE LANGUAGES; SEMANTIC FRAMEWORK; SIMPLY TYPED LAMBDA CALCULUS; TYPED LAMBDA CALCULUS;

FUNCTIONAL PROGRAMMING;

EID: 84976830729     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99370.99393     Document Type: Conference Paper

References (22)

1. L. Augustsson. A compiler for lazy ML. In Symposium on LISP and Functional Programming, pages 218-227, ACM, 1984.
2. V. Breazu-Tannen and A. R. Meyer. Lambda calculus with constrained types (extended abstract). In R. Parikh, editoT, Proceedings of the Conference on Logics of Programs, Brooklyn, June 1985, pages 23-40, Lecture Notes in Computer Science, Vol. 193, Springer-Verlag, 1985.
3. M. Coppo. Completeness of Type Assignment in Continuous Lambda Models. Theoretical Computer Science, 29:309-324, 1984.
4. M. Coppo. A Completeness Theorem for Recursively Defined Types. In G. Goos and J. H art manis, editors, Automata, Languages and Programming, 12th Colloquium, LNCS 194, pages 120-129, Splinger-Verlag, July 1985.
5. B. Courcelle. Fundamental Properties of Infinite Trees. Theoretical Computer Science, 25:95-169, 1983.
6. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proc. 9th ACM Symposium on Principles of Programming Languages, pages 207-212, 1982.
7. H. Friedman. Equations between function-als. In Lecture Notes in Mathematics 453, pages 22-33, Springer-Verlag, 1973.
8. R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic. Trans. American Mathematical Society, 146:29-60, December 1969.
9. R. Hindley. The Completeness Theorem for Typing A-Terms. Theoretical Computer Science, 22:1-17, 1983.
10. R. Harper, D. B. MacQueen, and R. Milner. Standard ML. LFCS Report Series ECS-LFCS-86-2, Department of Computer Science, University of Edinburgh, March 1986.
11. J. R. Hindley and J. P. Seldin. Introduction to Combinators and X-Calculus. Cambridge University Press, 1986.
12. G Huet. Résolution d'équations dans les langages d'ordre l, 2, .u. PhD thesis, University Paris, 1976.
13. A.R. Meyer and S.S. Cosmadakis. Semantical Paradigms. In Proc. IEEE Symposium on Logic in Computer Science, July 1988.
14. J. C. Mitchell and R. Harper. The Essence of ML. In Proc. 15th ACM Symposium on Principles of Programming Languages, pages 2846, San Diego, California, January 1988.
15. R. Milner. Fully abstract models of typed A-calculi. Theoretical Computer Science, 4:122, 1977.
16. R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348-375, 1978.
17. D.B. MacQueen, G.D. Plotkin, and Sethi. An ideal model for recursive polymorphic types. Information and Control, 71(1/2):95-130, 1986.
18. K. Mulmuley. A semantic characterization of full abstraction for typed lambda calculus. In Proc. 25-th IEEE Symposium on Fundations of Computer Science, pages 279-288, 1984.
19. A. Ohori. A Study of Types, Semantics and Languages for Databases and Object-oriented Programming. PhD thesis, University of Pennsylvania, 1989. To appear.
20. G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
21. D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 201, pages 1-16, Springer-Verlag, 1985.
22. M. Wand. A Types-as-Sets Semantics for Milner-Style Polymorphism. In Proc. 11th A CM Symposium on Principles of Programming Languages, pages 158-164, January 1984.