Weak polymorphism can be sound

Journal of Functional Programming

Volumn 6, Issue 1, 1996, Pages 111-141

  Greiner, John ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030552161     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800001593     Document Type: Article

References (21)

1. Damas, L. and Milner, R. (1982) Principal type-schemes for functional programs. In 9th ACM Symposium on Principles of Programming Languages, pp. 207-212. ACM Press.
2. Damas, L. (1985) Type Assignment in Programming Languages. PhD Thesis, University of Edinburgh.
3. Harper, R. (1993) A Simplified Account of Polymorphic References. Technical Report CMU-CS-93-169, Carnegie Mellon University.
4. Hindley, J. R. (1969) The principal type scheme of an object in combinatory logic. Trans. Am. Math. Soc., 146: 29-60.
5. Hindley, J. R. and Seldin, J. P. (1986) Introduction to Combinators and λ-Calculus. London Mathematical Society Student Texts, 1. Cambridge University Press.
6. Hoang, M., Mitchell, J. and Viswanathan, R. (1993) Standard ML weak polymorphism and imperative constructs. In 8th Symposium on Logic in Computer Science, pp. 15-25. IEEE Press.
7. Leroy, X. (1992) Polymorphic Typing of An Algorithmic Language. Technical Report 1778, Institute National de Recherche en Informatique et en Automatique. (English translation of PhD Thesis, Université Paris VII.)
8. Leroy, X. (1993) Polymorphism by name for references and continuations. In 20th ACM Symposium on Principles of Programming Languages, pp. 220-231. ACM Press
9. Leroy, X. and Weis, P. (1991) Polymorphic type inference and assignment. In 18th ACM Symposium on Principles of Programming Languages, pp. 291-302. ACM Press.
10. MacQueen, D. (1992) Source code for SML/NJ type inference algorithm, Versions 0.66, 0.75, and 0.93.
11. Milner, R. (1978) A theory of type polymorphism in programming languages. J. Computer & System Sci., 17: 348-375.
12. Milner, R., Tofte, M. and Harper, R. (1990) The Definition of Standard ML. MIT Press.
13. O'Toole, Jr., J. W. (1989) Type Abstraction Rules for References: A Comparison of Four Which Have Achieved Notoriety. Technical report MIT-LCS-TM-390, Massachussets Institute of Technology.
14. Reynolds, J. C. (1989) Syntactic Control of Interference, Part 2. In 16th Int. Colloquium on Automata, Languages and Programming, pp. 704-722. Springer-Verlag.
15. Talpin, J.-P. and Jouvelot, P. (1992) The type and effect discipline. In 7th IEEE Symposium on Logic in Computer Science, pp. 162-173. IEEE Press.
16. Talpin, J.-P. and Jouvelot, P. (1992) Polymorphic type, region and effect inference. J. Functional Programming, 2(3): 245-271.
17. Tofte, M. (1988) Operational Semantics and Polymorphic Type Inference. PhD Thesis, University of Edinburgh.
18. Tofte, M. (1990) Type inference for polymorphic references. Infor. & Computation, 89: 1-34.
19. Wright, A. K. (1992) Typing references by effect inference. In 4th Euro. Symposium on Programming: Lecture Notes in Computer Science 582, pp. 473-491. Springer-Verlag.
20. Wright, A. K. (1993) Polymorphism for Imperative Languages without Imperative Types. Technical Report 93-200, Rice University.
21. Wright, A. K. and Felleisen, M. (1991) A Syntactic Approach to Type Soundness. Technical Report 91-160, Rice University.