Type inference for record concatenation and subtyping

Information and Computation

Volumn 189, Issue 1, 2004, Pages 54-86

  Palsberg, Jens ^a   Zhao, Tian ^b  

^a University of California   (United States)

^b University of Wisconsin Milwaukee   (United States)

Author keywords

Complexity; Objects; Types

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; COMPUTER SIMULATION; CONSTRAINT THEORY; PROGRAM DIAGNOSTICS; THEOREM PROVING;

OBLIQ LANGUAGE; RECORD CONCATENATION; SUBTYPING; TYPE INFERENCE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1342265671     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.10.001     Document Type: Article

References (29)

1. M. Abadi, L. Cardelli, A Theory of Objects, Springer-Verlag, Berlin, 1996.
2. R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Transtions on Programming Languages and Systems 15 (4) (1993) 575-631, also in Proceedings of POPL'91.
3. A.H. Borning, D.H.H. Ingalls, Multiple inheritance in Smalltalk80, in: Proceedings of AAAI, 1982, pp. 234-237.
4. L. Cardelli, A langauge with distributed scope, in: Proceedings of POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995, pp. 286-297.
5. B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science 25 (1) (1983) 95-169.
6. P. Cousot, R. Cousot, Modular static program analysis, in: Proceedings of CC'02, International Conference on Compiler Construction, LNCS, vol. 2304, Springer-Verlag, Berlin, 2002, pp. 159-178.
7. N. Glew, An efficient class and object encoding, in: Proceedings of OOPSLA'00, ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, 2000 pp. 311-324.
8. R. Harper, B. Pierce, A record calculus based on symmetric concatenation, in: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, ACM, 1991, pp. 131-142.
9. D. Kozen, J. Palsberg, M.I. Schwartzbach, Efficient inference on partial types, Journal of Computer and System Sciences 49 (2) (1994) 306-324, preliminary version in Proceedings of FOCS'92, 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, October 1992, pp. 363-371.
10. R. Milner, Operational and algebraic semantics of concurrent processes, in: J. van Leewen (Ed.), Handbook of Theoretical Computer Science, Formal Models and Semantics, vol. B, The MIT Press, New York, NY, 1990, pp. 1201-1242, Chapter 19.
11. F. Nielson, The typed lambda-calculus with first-class processes, in: Proceedings of PARLE'89, 1989, pp. 357-373.
12. J. Palsberg, Efficient inference of object types, Information and Computation 123 (2) (1995) 198-209, preliminary version in Proceedings of LICS'94, Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, July 1994, pp. 186-195.
13. J. Palsberg, P.M. O'Keefe, A type system equivalent to flow analysis, ACM Transactions on Programming Languages and Systems 17 (4) (1995) 576-599, preliminary version in Proceedings of POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California , January 1995, pp. 367-378.
14. J. Palsberg, S. Smith, Constrained types and their expressiveness, ACM Transactions on Programming Languages and Systems 18 (5) (1996) 519-527.
15. J. Palsberg, M. Wand, P.M. O'Keefe, Type inference with non-structural subtyping, Formal Aspects of Computing 9 (1997) 49-67.
16. J. Palsberg, T. Zhao, T. Jim, Automatic discovery of covariant read-only fields, informal Proceedings of FOOL'02, Ninth International Workshop on Foundations of Object-Oriented Languages, Portland, Oregon, 2002.
17. B. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes, in: LICS'93, Eighth Annual Symposium on Logic in Computer Science, 1993, pp. 376-385.
18. F. Pottier, Simplifying subtyping constraints, in: Proceedings of ACM SIGPLAN International Conference on Functional Programming 1996, pp. 122-133.
19. F. Pottier, A 3-part type inference engine, in: In: G. Smolka (Ed.), Proceedings of the 2000 European Symposium on Programming (ESOP'00), vol. 1782, Springer-Verlag, Berlin, 2000, pp. 320-335.
20. D. Rémy, Typing record concatenation for free, in: ACM Symposium on Principles of Programming Languages, 1992, pp. 166-176.
21. M. Shields, E. Meijer, Type-indexed rows, in: Symposium on Principles of Programming Languages, 2001, pp. 261-275.
22. B. Stroustrup, A history of C++: 1979-1991, in: History of Programming Languages Conference (HOPL-II), 1993, pp. 271-297.
23. B. Stroustrup, A history of C++: 1979-1991, in: History of Programming Languages Conference (HOPL-II), 1993, pp. 271-297.
24. M. Sulzmann, Designing record systems, Available from ,+ 1997.
25. H. Tsuiki, On typed calculi with a merge operator, in: Foundations of Software Technology and Theoretical Computer Science, 1994, pp. 101-112.
26. M. Wand, Type inference for record concatenation and multiple inheritance, Information and Computation 93 (1) (1991) 1-15.
27. A. Wright, M. Felleisen, A syntactic approach to type soundness, Information and Computation 115 (1) (1994) 38-94.
28. J. Zwanenburg, Record concatenation with intersection types, Technical Report 95-34, Eindhoven University of Technology, 1995.
29. J. Zwanenburg, A type system for record concatenation and subtyping, in: K. Bruce, G. Longo (Eds.), Informal Proceedings of FOOL'96, Third Workshop on Foundation of Object-Oriented Languages, 1996.