Semi-Explicit First-Class Polymorphism for ML

Information and Computation

Volumn 155, Issue 1-2, 1999, Pages 134-169

  Garrigue, Jacques ^a   Rémy, Didier ^b  

^a KYOTO UNIVERSITY   (Japan)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (28)

1. Aiken, A., and Wimmers, E. L. (1993), Type inclusion constraints and type inference, in "Conference on Functional Programming Languages and Computer Architecture," pp. 32-41, Assoc. Comput. Mach, New York.
2. Cardelli, L. (1993), "An Implementation of FSub," Research Report 97, Digital Equipment Corportation, Systems Research Center.
3. Damas, L., and Milner, R. (1982), Principal type-schemes for functional programs, in "Proceedings of the Ninth ACM Conference on Principles of Programming Languages," pp. 207-212.
4. Dowek, G., Hardin, T., Kirchner, C., and Pfenning, F. (1996), Higher-order unification via explicit substitutions: the case of higher-order patterns, in "Joint International Conference and Symposium on Logic Programming" (M. Maher, Ed.), pp. 259-273.
5. Duggan, D. (1995), "Polymorphic Methods with Self Types for ML-like Languages," Technical report cs-95-03, University of Waterloo.
6. Eifrig, J., and Trifonov, V. (1995a), Sound polymorphic type inference for objects, in "OOPSLA."
7. Eifrig, J., Smith, S., and Trifonov, V. (1995b), Type inference for recursively constrained types and its application to OOP, in "Mathematical Foundations of Programming Semantics."
8. Garrigue, J., and Rémy, D. (1997), ML with semi-explicit higher-order polymorphism, in "Theoretical Aspects of Computer Software" (Takayasu Ito and Martin Abadi, Eds.), Lecture Notes in Computer Science, Vol. 1281, pp. 20-46, Springer-Verlag, Berlin/New York.
9. Huet, G. (1976), "Résolution d'équations dans les langages d'ordre 1, 2, ..., ω." Doctoral thesis, Université Paris 7.
10. Jouannaud, J.-P., and Kirchner, C. (1991), Solving equations in abstract algebras: a rule-based survey of unification, in "Computational Logic. Essays in Honor of Alan Robinson" (Jean-Louis Lassez and G. Plotkin, Eds.), Chap. 8, pp. 257-321, MIT Press, Cambridge, MA.
11. Kfoury, A. J., and Wells, J. B. (1994), A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus, in "Proceedings of the ACM Conference on Lisp and Functional Programming, Orlando, Florida," pp. 196-207.
12. Läufer, K., and Odersky, M. (1994), Polymorphic type inference and abstract data types, ACM Trans. Progr. Lang. Systems 16, 1411-1430.
13. Leroy, X., and Mauny, M. (1991), Dynamics in ML, in "Conference on Functional Programming and Computer Architecture" (John Hughes, Ed.), Lecture Notes in Computer Science, Vol. 523, pp. 406-426, Springer-Verlag, Berlin/New York.
14. Mitchell, J. C. (1984), Polymorphic type inference and containment, in "Proceedings of the International Symposium on Semantics of Data Types, Sophia-Antipolis, France," Lecture Notes in Computer Science, Vol. 173, pp. 257-278, Springer-Verlag, Berlin/New York. [Full version in Inform. and Comput. 76, 211-249, 1988. Reprinted in "Logical Foundations of Functional Programming" (G. Huet, Ed.), pp. 153-194, Addison-Wesley, Reading, PA, 1990.]
15. Mitchell, J. C. (1984), Polymorphic type inference and containment, in "Proceedings of the International Symposium on Semantics of Data Types, Sophia-Antipolis, France," Lecture Notes in Computer Science, Vol. 173, pp. 257-278, Springer-Verlag, Berlin/New York. [Full version in Inform. and Comput. 76, 211-249, 1988. Reprinted in "Logical Foundations of Functional Programming" (G. Huet, Ed.), pp. 153-194, Addison-Wesley, Reading, PA, 1990.]
16. Mitchell, J. C. (1984), Polymorphic type inference and containment, in "Proceedings of the International Symposium on Semantics of Data Types, Sophia-Antipolis, France," Lecture Notes in Computer Science, Vol. 173, pp. 257-278, Springer-Verlag, Berlin/New York. [Full version in Inform. and Comput. 76, 211-249, 1988. Reprinted in "Logical Foundations of Functional Programming" (G. Huet, Ed.), pp. 153-194, Addison-Wesley, Reading, PA, 1990.]
17. Odersky, M., and Läufer, K. (1996), Putting type annotations to work, in "Proceedings of the 23rd ACM Conference on Principles of Programming Languages," pp. 54-67.
18. Pfenning, F. (1988), Partial polymorphic type inference and higher-order unification, in "Proceedings of the ACM Conference on Lisp and Functional Programming, Snowbird, Utah," pp. 153-163, Assoc. Comput. Mach., New York.
19. Pfenning, F. (1993), On the undecidability of partial polymorphic type reconstruction, Fund. Inform. 19, 185-199. [Preliminary version available as Technical Report CMU-CS-92-105, School of Computer Science, Carnegie Mellon University, January 1992.]
20. Pierce, B. C., and Turner, D. N. (1997a), "Local Type Argument Synthesis with Bounded Quantification," Technical report 495, Computer Science Department, Indiana University.
21. Pierce, B. C., and Turner, D. N. (1997b), "Pict: A Programming Language Based on the Pi-Calculus," Technical report, Computer Science Department, Indiana University.
22. Pierce, B. C., and Turner, D. N. (1998), Local Type inference, in "Proceedings of the 25th ACM Conference on Principles of Programming Languages." [ Full version abailable as Indiana University CSCI Technical Report 493.]
23. Pottier, F. (1996), Simplifying subtyping constraints, in "Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming (ICFP'96)," pp. 122-133.
24. Rémy, D. (1992), "Extending ML Type System with a Sorted Equational Theory," Research report 1766, Institut National de Recherche en Informatique et Automatisme, Rocquencourt, Le Chesnay Cedex, France.
25. Rémy, D. (1994), Programming objects with ML-ART: An extension to ML with abstract and record types, in "Theoretical Aspects of Computer Software" (Masami Hagiya and John C. Mitchell, Eds.), Lecture Notes in Computer Science, Vol. 789, pp. 321-346, Springer-Verlag, Berlin/New York.
26. Rémy, D., and Vouillon, J. (1997), Objective ML: A simple object-oriented extension to ML, in "Proceedings of the 24th ACM Conference on Principles of Programming Languages," pp. 40-53, Assoc. Comput. Mach., New York.
27. Wells, J. B. (1994), Typability and type checking in the second order λ-calculus are equivalent and undecidable, in "Ninth Annual IEEE Symposium on Logic in Computer Science," Paris, France, pp. 176-185.
28. Wright, A. K. (1993), "Polymorphism for Imperative Languages without Imperative Types," Technical report 93-200, Rice University.