Type-Directed Specialization of Polymorphism

Information and Computation

Volumn 155, Issue 1-2, 1999, Pages 64-107

  Ohori, Atsushi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (40)

1. Alimohamed, M. (1995), A characterization of lambda definability in categorical models of implicit polymorphism, Theoret. Comput. Sci. 146, 5-23.
2. Appel, A. W., and MacQueen, D. B. (1991), Standard ML of New Jersey, in "Proceedings of Third International Symposium on Programming Languages and Logic Programming," pp. 1-13.
3. Birkedal, L., and Harper, R. (1997), Relational interpretations of recursive types in an operational setting, in "Proc. Theoretical Aspects of Computer Software," pp. 458-490.
4. Breazu-Tannen, V., Coquand, T., Gunter, C. A., and Scedrov, A. (1991), Inheritance as explicit coercion, Inform. and Comput. 93, 172-221.
5. Buneman, P., and Ohori, A. (1996), Polymorphism and type inference in database programming, ACM Trans. Database Systems 21, 30-74.
6. Cardelli, L., and Wegner, P. (1985), On understanding types, data abstraction, and polymorphism, Comput. Surv. 17, 471-522.
7. Crary, K., Weirich, S., and Morrisett, G. (1998), Intensional polymorphism in type-erasure semantics, in "Proc. International Conference on Functional Programming," pp. 301-312.
8. Damas, L., and Milner, R. (1982), Principal type-schemes for functional programs, in "Proc. ACM Symposium on Principles of Programming Languages," pp. 207-212.
9. Elsman, M. (1998), Polymorphic equality - no tags required, in "Proceedings of the 2nd International Workshop on Types in Compilation, Kyoto, March 1998," pp. 136-155.
10. Girard, J.-Y. (1971), Une extension de l'interpretation de gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et théorie des types, in "Second Scandinavian Logic Symposium," pp. 63-92, North-Holland, Amsterdam.
11. Hall, C., Hammond, K., Peyton Jones, S., and Wadler, P. (1994), "Type classes in Haskell," Technical report, University of Glasgow.
12. Harper, R., and Mitchell, J. C. (1993), On the type structure of Standard ML, ACM Trans. Progr. Languages Systems 15, 211-252.
13. Harper, R., and Morrisett, G. (1995), Compiling polymorphism using intensional type analysis, in "Proc. ACM Symposium on Principles of Programming Languages," pp. 130-141.
14. Hasegawa, M. (1999), Logical predicates for intuitionistic linear type theories, in "Proc. TLCA Conference," pp. 198-212.
15. 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. (1992), Report on programming language Haskel a non-strict, purely functional language version 1.2, SIGPLAN Notices [Haskell special issue] 27(5).
16. Jones, M. (1992), A theory of qualified types, in "Proc. ESOP Symposium," pp. 287-306.
17. Jones, M. (1994), ML typing, explicit polymorphism and qualified types, in "Proc. Theoretical Aspects of Computer Software," pp. 56-75.
18. Kahn, G. (1987), Natural semantics, in "Proc. Symposium on Theoretical Aspects of Computer Science," pp. 22-39, Springer-Verlag, Berlin/New York.
19. Leroy, X. (1992), "Polymorphic Typing of an Algorithmic Language," Ph.D. thesis, University of Paris VII.
20. Leroy, X. (1992), Unboxed objects and polymorphic typing, in "Proc. ACM Symposium on Principles of Programming Languages," pp. 177-188.
21. Leroy, X. (1992), "The ZINC Experiment: an Economical Implementation of the ML Language," Technical Report 117, INRIA.
22. Leroy, X. (1997), "The Objective Caml User's Manual," INRIA Rocquencourt, Le Chesnay, France.
23. Milner, R. (1978), A theory of type polymorphism in programming, J. Comput. System Sci. 17, 348-375.
24. Milner, R., Tofte, M., and Harper, R. (1990), "The Definition of Standard ML," MIT Press, Cambridge, MA.
25. Minamide, Y. (1996), Compilation based on a calculus for explicit type passing, in "Proceedings of Fuji International Workshop on Functional and Logic Programming," pp. 301-320.
26. Minamide, Y. (1998), A functional representation of data structures with a hole, in "Proc. ACM Symposium on Principles of Programming Languages," pp. 75-84.
27. Minamide, Y., Morrisett, G., and Harper, R. (1996), Typed closure conversion, in "Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages," pp. 271-283, Assoc. Comput. Mach., New York.
28. Mitchell, J. C. (1990), Type systems for programming languages, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Chap. 8, pp. 365-458, MIT Press/Elsevier, Cambridge, MA/Amsterdam.
29. Ohori, A. (1989), A simple semantics for ML polymorphism, in "Proceedings of ACM/IFIP Conference on Functional Programming Languages and Computer Architecture, London, sept. 1989," pp. 281-292.
30. Ohori, A. (1992), A compilation method for ML-style polymorphic record calculi, in "Proc. ACM Symposium on Principles of Programming Languages," pp. 154-165.
31. Ohori, A. (1995), A polymorphic record calculus and its compilation, ACM Trans. Progr. Languages Systems 17, 844-895.
32. Ohori, A., and Takamizawa, T. (1997), A polymorphic unboxed calculus as an abstract machine for polymorphic languages, J. Lisp Symbolic Comput. 10, 61-91.
33. Peterson, J., and Jones, M. (1993), Implementing type classes, in "Proc. ACM Conference on Programming Language Design and Implementation," pp. 227-236.
34. Peyton Jones, S. L., and Launchbury, J. (1991), Unboxed values as first class citizens in a non-strict functional language, in "Proc. Conference on Functional Programming Languages and Computer Architecture," Lecture Notes in Computer Science, Vol. 523, pp. 636-666, Springer-Verlag, Berlin/ New York.
35. Rémy, D. (1994), Efficient representation of extensible records, in "Proc. ACM SIGPLAN Workshop on ML and Its Applications," pp. 12-16.
36. Reynolds, J. C. (1974), Towards a theory of type structure, in "Paris Colloq. on Programming," pp. 408-425, Springer-Verlag, Berlin/New York.
37. Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., and Lee, P. (1996), TIL: A type-directed optimizing compiler for ML, in "Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation," pp. 181-192, Assoc. Comput. Mach. Press, New York.
38. Tofte, M. (1988), "Operational Semantics and Polymorphic Type Inference," Ph.D. thesis, Department of Computer Science, University of Edinburgh.
39. Tolmach, A. (1994), Tag-free garbage collection using explicit type parameters, in "Proc. ACM Conference on Lisp and Functional Programming," pp. 1-11.
40. Wright, A. K. (1995), Simple imperative polymorphism, J. Lisp Symbolic Comput. 8, 343-355.