Automatic discovery of covariant read-only fields

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 1, 2005, Pages 126-162

  Palsberg, Jens ^a,c   Zhao, Tian ^a,c   Jim, Trevor ^b,d  

^a PURDUE UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c Purdue University   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Constraints; Types

Indexed keywords

FLEXIBLE MATCHING; INTERMEDIATE LANGUAGES; SUBTYPING; TYPE SYSTEMS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING; ROM; SEMANTICS; SET THEORY;

AUTOMATIC PROGRAMMING;

EID: 13644274759     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/1053468.1053472     Document Type: Article

References (37)

1. ABADI, M. AND CARDELLI, L. 1996. A Theory of Objects. Springer-Verlag, New York.
2. AIKEN, A. AND WIMMERS, E. 1993. Type inclusion constraints and type inference. In Proceedings of Conference on Functional Programming Languages and Computer Architecture, pp. 31-41.
3. BENKE, M. 1993. Efficient type reconstruction in the presence of inheritance. In Proceedings of Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 711. Springer-Verlag, New York, 272-280.
4. BRACHA, G., ODERSKY, M., STOUTAMIRE, D., AND WADLER, P. 1998. Making the future safe for the past: Adding genericity to the Java programming language. In Proceedings of OOPSLA'98, ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications. ACM, New York, pp. 183-200.
5. BUGLIESI, M. AND PERICAS-GEERTSEN, S. 2002. Type inference for variant object types. Inf. Comput. 177, 1, 2-27.
6. FREY, A. 1997. Satisfying systems of subtype inequalities in polynomial space. In Proceedings of SAS'97, International Static Analysis Symposium. Lecture Notes in Computer Science. Springer-Verlag, New York.
7. GLEW, N. 2000. An efficient class and object encoding. In Proceedings of OOPSLA'00, ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (Minneapolis, Minn. Oct.). ACM, New York, pp. 311-324.
8. 3 barrier: Faster object type inference. In Proceedings of the 4th International Workshop on Foundations of Object-Oriented Languages. http://www.cs.williams.edu/kim/FOOL/index.html.
9. HOANG, M. AND MITCHELL, J. C. 1995. Lower bounds on type inference with subtypes. In Proceedings of POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, pp. 176-185.
10. IGARASHI, A. AND KOBAYASHI, N. 2000 Type reconstruction for linear pi-calculus with I/O subtyping. Inf. Comput., 161, 1, 1-44.
11. IGARASHI, A. AND VIROLI, M. 2002. On variance-based subtyping for parametric types. In Proceedings of ECOOP'02, 16th European Conference on Object-Oriented Programming.
12. KOZEN, D., PALSBERG, J., AND SCHWARTZBACH, M. I. 1994. Efficient inference of partial types. J. Comput. Syst. Sci. 49, 2, 306-324. Preliminary version in Proceedings of FOCS'92, 33rd IEEE Symposium on Foundations of Computer Science (Pittsburgh, Pa., Oct.). IEEE Computer Society Press, Los Alamitos, Calif, pp. 363-371.
13. KOZEN, D., PALSBERG, J., AND SCHWARTZBACH, M. I. 1994. Efficient inference of partial types. J. Comput. Syst. Sci. 49, 2, 306-324. Preliminary version in Proceedings of FOCS'92, 33rd IEEE Symposium on Foundations of Computer Science (Pittsburgh, Pa., Oct.). IEEE Computer Society Press, Los Alamitos, Calif, pp. 363-371.
14. MACQUEEN, D., PLOTKIN, G., AND SETHI, R. 1986. An ideal model for recursive polymorphic types. Inf. Comput. 71, 1/2 (Oct./Nov.), 95-130.
15. MCALLESTER, D. 2002. On the complexity analysis of static analyses. J. ACM 49, 4, 512-537.
16. MILNER, R. 1990. Operational and algebraic semantics of concurrent processes. In Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Chap. 19, J. van Leewen, Ed. The MIT Press, New York, N.Y., pp. 1201-1242.
17. MILNER, R. AND TOFTE, M. 1991. Co-induction in relational semantics. Theoret. Comput. Sci. 87, 1, 209-220.
18. MITCHELL, J. C. 1991. Type inference with simple subtypes. J. Funct. Prog, 1, 245-285.
19. MÜLLER, M., NIEHREN, J., AND PODELSKI, A. 2000. Ordering constraints over feature trees. Constr. Internat. J. 5, 1-2 (Jan.), 7-42.
20. NIELSON, F. 1989. The typed lambda-calculus with first-class processes. In Proceedings of PARLE'89. pp. 357-373.
21. PALSBERG, J. 1995. Efficient inference of object types. Inf. Comput. 123, 2, 198-209. (Preliminary version in Proceedings ofLICS'94, Ninth Annual IEEE Symposium on Logic in Computer Science (Paris, France, July 1994), pp. 186-195.)
22. PALSBERG, J. 1995. Efficient inference of object types. Inf. Comput. 123, 2, 198-209. (Preliminary version in Proceedings ofLICS'94, Ninth Annual IEEE Symposium on Logic in Computer Science (Paris, France, July 1994), pp. 186-195.)
23. PALSBERG, J. AND JIM, T. 1997. Type inference with simple selftypes is NP-complete. Nord. J. Comput. 4, 3, 259-286.
24. PALSBERG, J. AND O'KEEFE, P. M. 1995. A type system equivalent to flow analysis. ACM Trans. Prog. Lang. Syst. 17, 4 (July), 576-599. (Preliminary version in Proceedings of POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages (San Francisco, Calif., Jan. 1995), pp. 367-378.)
25. PALSBERG, J. AND O'KEEFE, P. M. 1995. A type system equivalent to flow analysis. ACM Trans. Prog. Lang. Syst. 17, 4 (July), 576-599. (Preliminary version in Proceedings of POPL'95, 22nd Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages (San Francisco, Calif., Jan. 1995), pp. 367-378.)
26. PALSBERG, J. AND SMITH, S. 1996. Constrained types and their expressiveness. ACM Trans. Prog. Lang. Syst. 18, 5 (Sept.), 519-527.
27. PALSBERG, J., WAND, M., AND O'KEEFE, P. M. 1997. Type inference with non-structural subtyping. Form. Asp. Comput. 9, 49-67.
28. PIERCE, B. AND SANGIORGI, D. 1993. Typing and subtyping for mobile processes. In Annual Symposium on Logic in Computer Science (LICS'93), pp. 376-385.
29. PIERCE, B. C. 2002. Types and Programming Languages. MIT Press, Cambridge, Mass.
30. POTTIER, F. 1996. Simplifying subtyping constraints. In Proceedings of ACM SIGPLAN International Conference on Functional Programming. ACM, New York, pp. 122-133.
31. RÉMY, D. 1998. From classes to objects via subtyping. In Proceedings of the European Symposium on Programming (Mar.). Lecture Notes in Computer Science, vol. 1381. Springer-Verlag, New York.
32. SULZMANN, M., MÜLLER, M., AND ZENGER, C. 1999. Hindley/Milner style type systems in constraint form. Tech. Rep. ACRC-99-009. University of South Australia.
33. TANG, F. AND HOFMANN, M. 2001. Type inference for objects with base types. Draft.
34. TANG, F. AND HOFMANN, M. 2002. Generation of verification conditions for Abadi and Leino's logic of objects. In Proceedings of FOOL'02, Ninth International Workshop on Foundations of Object-Oriented Languages (Portland, Ore., Jan.).
35. TIURYN, J. 1992. Subtype inequalities. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS'92). IEEE Computer Society Press, Los Alamitos, Calif., pp. 308-315.
36. WAND, M., O'KEEFE, P. M., AND PALSBERG, J. 1995. Strong normalization with non-structural subtyping. Math. Struct. Comput. Sci. 5, 3, 419-430.
37. WRIGHT, A. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Inf. Comput. 115, 1, 38-94.