Type inference, principal typings, and let-polymorphism for first-class mixin modules

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2005, Pages 156-167

  Makholm, Henning ^a   Wells, J B ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Mixin modules; Polymorphism; Record concatenation; Row unification; Type systems

Indexed keywords

CONSTRAINT SOLVING; MIXIN MODULES; PROGRAMMING ABSTRACTIONS; RECORD CONCATENATION; RECURSIVE DEFINITIONS; ROW UNIFICATION; TYPE INFERENCE ALGORITHM; TYPE SYSTEMS;

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; POLYMORPHISM;

INFERENCE ENGINES;

EID: 38349053991     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1086365.1086386     Document Type: Conference Paper

References (32)

1. D. Ancona, S. Fagorzi, E. Moggi, E. Zucca. Mixin modules and computational effects. In Proc. 30th Int'l Coll. Automata, Languages, and Programming, vol. 2719 of LNCS. Springer-Verlag, 2003.
2. D. Ancona, S. Fagorzi, E. Zucca. A calculus with lazy module operators. In IFIP TC1 3rd Int'l Conf. Theoret. Comput. Sci. (TCS '04). Kluwer Academic Publishers, 2004.
3. D. Ancona, E. Zucca. A primitive calculus for module systems. In Proc. Int'l Conf. Principles & Practice Declarative Programming, vol. 1702 of LNCS. Springer-Verlag, 1999.
4. D. Ancona, E. Zucca. A calculus of module systems. J. Funct. Programming, 12(2), 2002. Extended version of [3].
5. D. Duggan, C. Sourelis. Mixin modules. In Proc. 1996 Int'l Conf. Functional Programming. ACM Press, 1996.
6. Programming Languages & Systems, 9th European Symp. Programming, vol. 1782 of LNCS. Springer-Verlag, 2000.
7. M. Flatt, M. Felleisen. Units: Cool modules for HOT languages. In Proc. ACM SIGPLAN '98 Conf. Prog. Lang. Design & Impl., 1998.
8. R. Harper, B. C. Pierce. A record calculus based on symmetric concatenation. Technical Report CMU-CS-90-157R, Carnegie Mellon Univ., 1991.
9. R. Harper, B. C. Pierce. A record calculus based on symmetric concatenation. In Conf. Rec. 18th Ann. ACM Symp. Princ. of Prog. Langs., 1991.
10. T. Hirschowitz. Mixin Modules, Modules, and Extended Recursion in a Call-by-Value Setting. PhD thesis, Université Paris 7, 2003.
11. T. Hirschowitz. Rigid mixin modules. In Seventh International Symposium on Functional and Logic Programming (FLOPS 2004), 2004.
12. T. Hirschowitz, X. Leroy. Mixin modules in a call-by-value setting. In Programming Languages & Systems, 11th European Symp. Programming, vol. 2305 of LNCS. Springer-Verlag, 2002.
13. T. Hirschowitz, X. Leroy, J. B. Wells. Call-by-value mixin modules: Reduction semantics, side effects, types. In Programming Languages & Systems, 13th European Symp. Programming, vol. 2986 of LNCS. Springer- Verlag, 2004. More details can be found in [10].
14. H. Makholm, J. B. Wells. Type inference, principal typings, and letpolymorphism for first-class mixin modules. Technical report, Heriot-Watt Univ., School of Math. & Comput. Sci., 2005.
15. A. Ohori, P. Buneman. Type inference in a database programming language. In Proc. 1988 ACM Conf. LISP Funct. Program., Snowbird, Utah, U.S.A., 1988.
16. J. Palsberg, T. Zhao. Type inference for record concatenation and subtyping. Inform. & Comput., 189, 2004.
17. F. Pottier. A 3-part type inference engine. In ESOP '00 [6].
18. F. Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4), 2000.
19. F. Pottier. A constraint-based presentation and generalization of rows. In Proc. 18th Ann. IEEE Symp. Logic in Comput. Sci., 2003.
20. F. Pottier, D. Rémy. The essence of ML type inference. In B. C. Pierce, ed., Advanced Topics in Types and Programming Languages, chapter 10. MIT Press, Cambridge, Massachusetts, 2005.
21. D. Rémy. Typing record concatenation for free. In Conf. Rec. 19th Ann. ACM Symp. Princ. of Prog. Langs., 1992. A later version is [22].
22. D. Rémy. Typing record concatenation for free. In C. A. Gunter, J. C. Mitchell, eds., Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design. MIT Press, 1993.
23. D. Rémy. A case study of typechecking with constrained types: Typing record concatenation. Presented at the workshop on Advances in Types for Computer Science at the Newton Institute, Cambridge, UK, 1995.
24. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22(2), 1975.
25. S. Vansummeren. On the complexity of deciding typability in the relational algebra. Acta Informatica, 200X. To appear.
26. M. Wand. Complete type inference for simple objects. In Proc. 2nd Ann. Symp. Logic in Comput. Sci., 1987. A corrigendum appeared at LICS 1988.
27. M. Wand. Type inference for record concatenation and multiple inheritance. In Proc. 4th Ann. Symp. Logic in Comput. Sci., Pacific Grove, CA, U.S.A., 1989. IEEE Comput. Soc. Press.
28. M. Wand. Type inference for record concatenation and multiple inheritance. Inform. & Comput., 93, 1991.
29. J. B. Wells. The essence of principal typings. In Proc. 29th Int'l Coll. Automata, Languages, and Programming, vol. 2380 of LNCS. Springer- Verlag, 2002.
30. J. B.Wells, R. Vestergaard. Confluent equational reasoning for linking with first-class primitive modules (long version). A short version is [31]. Full paper, 3 appendices of proofs, 1999.
31. J. B. Wells, R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In ESOP '00 [6]. A long version is [30].
32. J. Zwanenburg. A type system for record concatenation and subtyping. In K. Bruce, G. Longo, eds., Third Workshop on Foundations of Object Oriented Languages (FOOL 3), Rutgers Univ., NJ, USA, 1996.