An unboxed operational semantics for ML polymorphism

Higher-Order and Symbolic Computation

Volumn 10, Issue 1, 1997, Pages 61-91

  Ohori, Atsushi ^a   Takamizawa, Tomonobu ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b IBM JAPAN LTD   (Japan)

Author keywords

ML; Operational semantics; Polymorphism; Type inference; Unboxed objects

Indexed keywords

EID: 53249095835     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Appel, A.W. and MacQueen, D.B. Standard ML of New Jersey. In Proceedings of Third International Symposium on Programming Languages and Logic Programming. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991, vol. 528, pp. 1-13.
2. Cousineau, G., Curien, P.-L., and Mauny, M. The categorical abstract machine. Science of Computer Programming, 8(2):173-202, 1987.
3. Damas, L. and Milner, R. Principal type-schemes for functional programs. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1982, pp. 207-212.
4. de Bruijn, N.G. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Math., 34:381-392, 1972.
5. Hall, C. Using Hindley-Milner type inference to optimize list representation. In Proceedings of the ACM Conference on Lisp and Functional Programming, ACM, New York, 1994.
6. Hall, C., Hammond, K., Peyton Jones, S., and Wadler, P. Type class in Haskell. Technical report, University of Glasgow, 1994.
7. Harper, R. and Mitchell, J.C. On the type structure of standard ML. ACM Trans. Program. Lang. Syst., 15(2):211-252, 1993.
8. Harper, R. and Morrisett, G. Compiling with non-parametric polymorphism. Technical Report CMU-CS-94-122, School of Computer Science, Carnegie Mellon University, 1994.
9. Harper, R. and Morrisett, G. Compiling polymorphism using intensional type analysis. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1995, pp. 130-141.
10. Henglein, F. and Jørgensen, J. Formally optimal boxing. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1994, pp. 213-226.
11. Hudak, P., Peyton Jones, S., Wadler, P., Boutel, B., Fairbairn, J., Fasel, J., Guzman, M., Hammond, K., Hughes, J., Johnsson, T., Kieburtz, D., Nikhil, R., Partain, W., and Perterson J. Report on programming language Haskel a non-strict, purely functional language version 1.2. SIGPLAN Notices, Haskell special issue, 27(5), 1992.
12. Kahn, G. Natural semantics. In Proceedings of the Symposium on Theoretical Aspects of Computer Science. Springer Verlag, Berlin, 1987, pp. 22-39.
13. Leroy, X. Polymorphic Typing of an Algorithmic Language. Ph.D. thesis, University of Paris VII, 1992.
14. Leroy, X. Unboxed objects and polymorphic typing. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1992, pp. 177-188.
15. Leroy, X. The ZINC experiment: an economical implementation of the ML language. Technical Report 117, INRIA, 1992.
16. Milner, R., Tofte, M., and Harper, R. The Definition of Standard ML. The MIT Press, 1990.
17. Morrison, R., Dearle, A., Connor, R.C.H, and Brown, A.L. An ad hoc approach to the implementation of polymorphism. ACM Trans. Program. Lang. Syst., 13(3):342-371, 1991.
18. Ohori, A. A simple semantics for ML polymorphism. In Proceedings of the ACM/IFIP Conference on Functional Programming Languages and Computer Architecture. ACM, New York, 1989, pp. 281-292.
19. Ohori, A. A compilation method for ML-style polymorphic record calculi. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1992, pp. 154-165.
20. Ohori, A. A polymorphic record calculus and its compilation. ACM Trans. Program. Lang. Syst., 17(6):844-895, 1995.
21. Peterson, J. and Jones, M. Implementing type classes. In Proceedings of the ACM Conference on Programming Language Design and Implementation. ACM, New York, 1993, pp. 227-236.
22. Peyton Jones, S.L. and Launchbury, J. Unboxed values as first class citizens in a non-strict functional language. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991, vol. 523, pp. 636-666.
23. Shao, Z., Reppy, J.H., and Apple, A.W. Unrolling lists. In Proceedings of the ACM Conference on Lisp and Functional Programming, ACM, New York, 1994.
24. Thiemann, P. Unboxed values and polymorphic typing revisited. In Proceedings of the International Conference on Functional Programming Languages and Computer Architecture, 1995, pp. 24-35.
25. Tofte, M. Operational Semantics and Polymorphic Type Inference, Ph.D. thesis. Department of Computer Science, University of Edinburgh, 1988.
26. Tolmach, A. Tag-free garbage collection using explicit type parameters. In Proceedings of the ACM Conference on Lisp and Functional Programming. ACM, New York, 1994, pp. 1-11.
27. Wadler, P. and Blott, S. How to make ad hoc polymorphism less ad hoc. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 1989, pp. 60-76.