Simplifying subtyping constraints: A theory

Information and Computation

Volumn 170, Issue 2, 2001, Pages 153-183

  Pottier, François ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; ERROR ANALYSIS; FINITE AUTOMATA;

CONSTRAINT SIMPLIFICATION;

COMPUTER SCIENCE;

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

References (50)

1. [AC93] Amadio, R. M., and Cardelli, L. (1993), Subtyping recursive types, ACM Trans. Programming Languages Systems 15, 575-631, available at http://research.microsoft.com/Users/luca/Papers/SRT.A4.ps.
2. [AC94a] Abadi, M., and Cardelli, L. (1994), A theory of primitive objects - Untyped and first-order systems, in "Theoretical Aspects of Computer Software" (M. Hagiya and John C. Mitchell, Eds.), Lecture Notes in Computer Science. Vol. 789, pp. 296-320, Springer-Verlag, New York. available at http://research.microsoft.com/Users/luca/Papers/PrimObj1stOrder.A4.ps.
3. [AC94b] Abadi, M., and Cardelli, L. (1994), A theory of primitive objects-second-order systems, in "Proc. of European Symposium on Programming" (D. Sannella, Ed.), "Lecture Notes in Computer Science, Vol. 788, pp. 1-25, Springer-Verlag, New York. available at http://research.microsoft.com/Users/luca/Papers/PrimObj2ndOrder.A4.ps.
4. [AF96] Aiken, A. S., and Fähndrich, M. (1996), "Making Set-Constraint Based Program Analyses Scale," Technical Report CSD-96-917, University of California, Berkeley, September, available at http://http.cs.berkeley.edu/̃manuel/papers/scw96.ps.gz.
5. [AFFS98] Aiken, A., Fähndrich, M., Foster, J. S., and Su, Z. (1998), "A toolkit for Constructing Type- and Constraint-based Program Analyses, Lecture Notes in Computer Science, Vol. 1473, pp. 76-96, Springer Verlag, Berlin, New York, available at http://www.cs.berkeley.edu/̃aiken/papers/tic98.ps.
6. [Aik94] Aiken, A. S. (1994), The Illyria system, available at http://http.cs.berkeley.edu:80/̃aiken/Illyria-demo.html.
7. [AW92] Aiken, A. S., and Wimmers, E. L. (1992), Solving systems of set constraints, in "Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, June 1992" (A. Scedrov, Ed.), IEEE Computer Society Press, Los Alamitos, CA, available at http://http.cs.berkeley.edu/̃aiken/ftp/lics92.ps.
8. [AW93] Aiken, A. S., and Wimmers, E. L. (1993), Type inclusion constraints and type inference, "Functional Programming & Computer Architecture," pp. 31-41, Assoc. Comput. Mach., New York, available at http://http.cs.berkeley.edu/̃aiken/ftp/fpca93.ps.
9. [AWL94] Aiken, A. S., Wimmers, E. L., and Lakshman, T. K. (1994), Soft typing with conditional types, "Conference Record of the 21st ACM Symposium on Principles of Programming Languages," pp. 163-173, available at http://http.cs.berkeley.edu/̃aiken/ftp/popl94.ps.
10. [AWP96] Aiken, A. S., Wimmers, E. L., and Palsberg, J. (1996), "Optimal Representations of Polymorphic Types with Subtyping," Technical Report CSD-96-909, University of California, Berkeley, July, available at http://http.cs.berkeley.edu/̃aiker./ftp/quant.ps.
11. [BM96] Bourdoncle, F., and Merz, S. (1996). On the Integration of Functional Programming. Class-Based Object-Oriented Programming, and Multi-Methods," Research Report 26. Centre de Mathématiques Appliquées. Ecole des Mines de Paris, Paris, March, available at http://www.cma.ensmp.fr/Francois.Bourdoncle/mlsub.ps.Z.
12. [BM97] Bourdoncle, F., and Merz, S. (1997), Type checking higher order polymorphic multi-methods, in "Conference Record of the 24th Annual ACM Symposium on Principles of Programming Languages," Paris, Januao 1997," pp. 302-315. Assoc. Comput. Math., New York, available at http://www.cma.ensmp.fr/Francois.Bourdoncle/popl97.ps.Z.
13. [Car88] Cardelli, L. (1988), A semantics of multiple inheritance. Inform. and Comput. 76, 138-164. A revised version of the paper that appeared in the 1984 Semantics of Data Types Symposium, Lecture Notes in Computer Science. Vol. 173, pp. 51-66. Springer-Verlag, Berlin, New York, available at http://research.microsoft.com/Users/luca/Papers/Inheritance.A4.ps.
14. [Car88] Cardelli, L. (1988), A semantics of multiple inheritance. Inform. and Comput. 76, 138-164. A revised version of the paper that appeared in the 1984 Semantics of Data Types Symposium, Lecture Notes in Computer Science. Vol. 173, pp. 51-66. Springer-Verlag, Berlin, New York, available at http://research.microsoft.com/Users/luca/Papers/Inheritance.A4.ps.
15. [Cou83] Courcelle, B. (1983), Fundamental properties of infinite trees. Theor. of Comput. Sci. 25, 95-169.
16. [EST95a] Eifrig, J., Smith, S., and Trifonov, V. (1995), Sound polymorphic type inference for objects, ACM SIGPLAN Notice 30, 169-184, available at http://www.cs.jhu.edu/̃trifonov/papers/sptio.ps.gz.
17. [EST95b] Eifrig, J., Smith, S., and Trifonov, V. (1995), Type inference for recursively constrained types and its application to OOP, in "Mathematical Foundations of Programming Semantics, New Orleans," Electronic Notes in Theoretical Computer Science. Vol. 1. Elsevier, Amsterdam, available at http://www.elsevier.nl/locate/entcs/volume1.html.
18. [FF96] Flanagan, C., and Felleisen, M. (1996), "Modular and Polymorphic Set-Based Analysis: Theory and Practice," Technical Report TR96-266. Rice University, available at http://www.cs.rice.edu/CS/PLT/Publications/tr96-266.ps.gz.
19. [FF97] Flanagan, C., and Folleisen, M. (1997), Componential set-based analysis, in "Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, Las Vegas, Nevada, June 1997," pp. 235-248, available at http://www.cs.rice.edu/CS/PLT/Publications/pldi97-ff.ps.gz.
20. [FFSA98] Fähndrich, M., Foster, J. S., Su, Z., and Aiken, A. S. (1998), Partial online cycle elimination in inclusion constraint graphs, in "Proceedings of the 1998 Conference on Programming Languages Design and Implementation, Montréal, June 1998," pp. 85-96. available at http://www.cs.berkeley.edu/̃manuel/papers/pldi98.ps.
21. [Fäh99] Fähndrich, M. (1999), BANF: A Library for Scalable Constraint-Based Program Analysis," Ph.D. thesis, University of California al Berkeley, available at http://research.microsoft.com/̃maf/diss.ps.
22. [Fla97] Flanagan, C. (1997), "Effective Static Debugging via Componential Set-Based Analysis," Ph.D. thesis, Rice University, available at http://www.cs.rice.edu/CS/PLT/Publications/thesis-flanagan.ps.gz.
23. [FM88] Fuh, Y.-C., and Mishra, P. (1988), Type inference with subtypes, in "Proceedings of the European Symposium on Programming" (H. Ganzinger, Ed.), Lecture Notes in Computer Science, Vol. 300, pp. 94-114, Springer-Verlag, Berlin.
24. [FM89] Fuh, Y.-C., and Mishra, P. (1988), Polymorphic subtype inference: Closing the theory-practice gap, in "Proceedings of the International Joint Conference on Theory and Practice of Software Development, Vol. 2" (J. Díaz and F. Orejas, Eds.), Lecture Notes in Computer Science, Vol. 352, pp. 167-183. Springer-Verlag, Berlin.
25. [Fre97] Frey, A. (1997), Satisfying subtype inequalities in polynomial space, in "Proceedings of the Fourth International Symposium on Static Analysis (SAS'97), Paris, France, September 1997" (P. Van Hentenryck, Ed.), Lecture Notes in Computer Science, Vol. 1302, pp. 265-277, Springer-Verlag, Berlin, available at http://www.cma.ensmp.fr/Alexandre.Frey/Publicatins/SAS97.ps.gz.
26. 3 barrier: Faster object type inference, in "Proc. 4th Int'l Workshop on Foundations of Object-Oriented Languages (FOOL), Paris, France, January 1997" (B. Pierce, Ed.), available at http://www.cis.upenn.edu/̃bcpierce/fool/henglein.ps.gz.
27. [Hop71] Hopcroft, J. E. (1971) An n log n algorithm for minimizing states in a finite automaton, in "Theory of Machines and Computations" (Z. Kohavi, Ed.), pp. 189-196. Academic Press, New York.
28. [HR98] Henglein, F., and Rehof, J. (1998), Constraint automata and the complexity of recursive subtype entailment, in "25th International Colloquium on Automata, Languages, and Programming (ICALP'98), July 1998," available at http://research.microsoft.com/̃rehof/icalp98.ps.
29. [Hue76] Huet, G. (1976), "Résolutuion d'équations dans des languages d'ordre 1, 2,...,ω," Ph.D. thesis. Université Paris 7.
30. [JK90] Jouannaud, J.-P., and Kirchner, C. (1990), "Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification." Technical Report 561, Université Paris-Sud, 91405 Orsay, France, April.
31. [KPS93] Kozen, D., Palsberg, J., and Schwartzbach, M. I. (1993), Efficient recursive subtyping, in "Proceedings POPL '93," pp. 419-428, available at ftp://ftp.daimi.aau.dk/pub/palsberg/papers/popl93.ps.Z.
32. [Mil78] Milner, R. (1978). A theory of type polymorphism in programming, J. Comput. System Sci. 17, 348-375.
33. [Mit84] Mitchell, J. C. (1984), Coercion and type inference, in "11th Annual ACM Symposium on Principles of Programming Languages." pp. 175-185.
34. [MPS86] MacQneen, D. B., Plotkin, G. D., and Sethi, R. (1986), An ideal model for recursive polymorphic types, Inform. and Control 71, 95-130.
35. [MR00] Melski, D., and Reps, T. (2000), Interconvertibility of a class of set constraints and context-free language reachability. Theoret. Comput. Sci. 248, available at http://www.cs.wisc.edu/wpis/papers/tcs_submission98r2.ps.
36. [NMP97] Niehren, J., Müller, M., and Podelski, A. (1997), Inclusion constraints over nonempty sets of trees, in "Theory and Practice of Software Development. International Joint Conference CAAP/FASE/TOOLS" (M. Dauchet, Ed.), Lecture Notes in Computer Science, Vol. 1214, Springer-Verlag, Berlin, available at ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingsSysLab/ines97.ps.Z.
37. [NP01] Niehren, J., and Priesnitz, T. (2001), Non-structural Subtype Entailment in Automata Theory, in "Fourth International Symposium on Theoretical Aspects of Computer Software." October 2001, available at ftp://ftp.ps.unisb.de/pub/papers/ProgrammingSysLab/pauto.ps.gz.
38. [OSW99] Odersky, M., Sulzmann, M., and Wehr, M. (1999), Type inference with constrained types, Theoret. Pract. Object System 5, available at http://www.cs.mu.oz.au/̃sulzmann/publications/tapes.ps.
39. [Pal95] Palsberg, J. (1995). Efficient inference of object types, Inform. and Comput. 123, 198-209, available at http://www.cs.purdue.edu/homes/palsberg/paper/ic95-p.ps.gz.
40. [PO95] Palsberg, J., and O'Keefe, P.M. (1995), A type system equivalent to flow analysis, in "Conference Record of POPL '95: 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, Calif.," Assoc. Comput. Mach., New York, available at ftp://ftp.daimi.aau.dk/pub/palsberg/papers/popl95.ps.Z.
41. [Pot96] Pottier, F. (1996). Simplifying subtyping constraints, in "Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming (ICFP'96)," pp. 122-133, available at http://pauillac.inria.fr/̃fpottier/publis/fpottier-icfp96.ps.gz.
42. [Pot98a] Pottier, F. (1998), A framework for type inference with subtyping, in "Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming (ICFP'98)," pp. 228-238, available at http://pauillac.inria.fr/̃fpottier/publis/fpottier-icfp98.ps.gz.
43. [Pot98b] Pottier, F. (1998). "Synthése de types en présence de sous-typage: de la théorie á la pratique," Ph.D. thesis, Université Paris 7, available at http://pauillac.inria.fr/̃fpottier/publis/these-fpottier.ps.gz.
44. [Pot98c] Pottier, F. (1998), "Type Inference in the Presence of Subtyping: From Theory to Practice," Technical Report 3483, INRIA, for publication, available at ftp://ftp.inria.fr/INRIA/publication/RR/RR-3483.ps.gz.
45. [Pot00a] Pottier, F. (2000). A 3-part type inference engine, submitted, available at http://pauillac.inria.fr/̃fpottier/publis/fpottier-njc-2000.ps.gz.
46. [Pot00b] Pottier, F. (2000). Wallace: An efficient implementation of type inference with subtyping, available at http://pauillac.inria.fr/̃fpottier/wallace/.
47. [Rém92] Rémy, D. (1992). "Extending ML Type System with a Sorted Equational Theory." Technical Report 1766, INRIA, Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France, available at ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/eq-theory-on-types.ps.gz.
48. [SMZ99] Sulzmann, M., Müller, M., and Zenger, C. (1999), Hindley/Milner Style Type Systems in Constraint Form," Research Report ACRC-99-009, University of South Australia. School of Computer and Information Science, July, available at http://www.ps.uni-sb.de/̃mmueller/papers/hm-constraints.ps.gz.
49. [TS96] Trifonov, V., and Smith, S. (1996), Subtyping constrained types, in "Proceedings of the Third International Static Analysis Symposium," Lecture Notes in Computer Science, Vol. 1145, pp. 349-365, Springer-Verlag, Berlin, available at http://www.cs.jhu.edu/̃trifonov/papers/subcon.ps.gz.
50. [Wan87] Wand, M. (1987), A simple algorithm and proof for type inference, Fund. Inform. 10, 115-122, available at ftp://ftp.ccs.neu.edu/pub/people/wand/papers/fundamenta-87.dvi.