Standard ML-NJ Weak Polymorphism and Imperative Constructs

Information and Computation

Volumn 127, Issue 2, 1996, Pages 102-116

  Mitchell, John ^a   Viswanathan, Ramesh ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012651238     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0054     Document Type: Article

References (21)

1. Appel, A. W., and MacQueen, D. B. (1987), A Standard ML compiler, in "Functional Programming Languages and Computer Architecture," Lecture Notes in Computer Science, Vol. 274, pp. 301, 324, Springer-Verlag, Berlin/New York.
2. Appel, A. W., and MacQueen, D. B. (1991), Standard ML of New Jersey, in "Int'l Symp. Prog. Lang. Implementation and Logic," pp. 1-13, Springer-Verlag, Berlin/New York.
3. Curry, H. B., and Feys, R. (1958), "Combinatory Logic I," North-Holland, Amsterdam.
4. Damas, L. (1985), "Type Assignment in Programming Languages," Ph.D. thesis, Edinburgh University CST-33-85.
5. Greiner, John, Weak polymorphism can be sound, J. Funct. Programming, to appear.
6. Hindley, J. R. (1969), The principal type-scheme of an object in combinatory logic, Trans. Amer. Math. Soc. 146, 29-60.
7. Harper, R., and Lillibridge, M. (1991), A brug in SML polymorphic typing for continuations, E-mail to types@ theory.lcs,mit.edu.
8. Jouvelot, P., and Gifford, D. (1991), Algebraic reconstruction of types and effects, in "18th ACM Symposium on Principles of Programming Languages," pp. 303-310.
9. Kanellakis, P. C., Mairson, H. G., and Mitchell, J. C. (1991), Unification and ML type reconstruction, in "Computational Logic, Essays in Honor of Alan Robinson," pp. 444-478, MIT Press, Cambridge, MA.
10. Koenig, A. (1992), An anecdote about ML type inference, unpublished manuscript.
11. Kfoury, A. J., Tiuryn, J., and Urzyczyn, P. (1990), ML typability is Dexptime-complete, in "Proc. 15th Colloq. on Trees in Algebra and Programming," Lecture Notes in Computer Science, Vol. 431, pp. 206-220, Springer-Verlag, Berlin/ New York; to appear in J. Assoc. Comput. Mach, under title "An Analysis of ML Typability."
12. Kfoury, A. J., Tiuryn, J., and Urzyczyn, P. (1990), ML typability is Dexptime-complete, in "Proc. 15th Colloq. on Trees in Algebra and Programming," Lecture Notes in Computer Science, Vol. 431, pp. 206-220, Springer-Verlag, Berlin/ New York; to appear in J. Assoc. Comput. Mach, under title "An Analysis of ML Typability."
13. Leroy, X., and Weis, P. (1991), Polymorphic type inference and assignment, in "18th ACM Symposium on Principles of Programming Languages," pp. 291-302.
14. Milner, R. (1978), A theory of type polymorphism in programming, J. Comput. System Sci. 17, 348-375.
15. Milner, Robin, Tofte Mads, and Harper Robert (1990), "The Definition of Standard ML," MIT Press, Cambridge, MA.
16. Talpin, J.-P., and Jouvelot, P. (1992), The type and effect discipline, in "Proc. IEEE Symp. on Logic in Computer Science," pp. 162-173.
17. Tofte, M. (1988), "Operational Semantics and Polymorphic Type Inference," Ph.D. thesis, Edinburgh University; available as Edinburgh University Laboratory for Foundations of Computer Science Technical Report ECS-LFCS-88-54.
18. Tofte, M. (1990), Type inference for polymorphic references, Inform. and Comput. 89, 1-34.
19. Wright, A. K., and Felleisen, M. (1991), "A Syntactic Approach to Type Soundness," Technical Report TR91-160, Rice University.
20. Wright, A. K. (1992), Typing references by effect inference, in "Proceedings of the European Symposium on Programming."
21. Wright, A. K. (1995), Simple imperative polymorphism, Lisp Symbolic Comput., to appear.