Type inference with structural subtyping: A faithful formalization of an efficient constraint solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2895, Issue , 2003, Pages 283-302

  Simonet, Vincent ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ALGORITHM FOR SOLVING; COMPLEXITY RESULTS; CONSTRAINT SOLVERS; GENERIC TYPES; ITS EFFICIENCIES; SUBTYPINGS; TYPE INFERENCES;

FORMAL LANGUAGES;

EID: 0344583781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40018-9_19     Document Type: Article

References (40)

1. Bourdoncle, F., Merz, S.: Type checking higher-order polymorphic multi-methods. In: 24th Principles of Programming Languages. (1997)
2. Pottier, F.: A versatile constraint-based type inference system. Nordic Journal of Computing 7 (2000)
3. Aiken, A.S., Fähndrich, M.: Program analysis using mixed term and set constraints. In: 4th Static Analysis Symposium. (1997)
4. Palsberg, J., O'Keefe, P.M.: A type system equivalent to flow analysis. In: 22nd Principles of Programming Languages. (1995)
5. Pottier, F., Simonet, V.: Information flow inference for ML. In: 29th Principles of Programming Languages. (2002)
6. Mitchell, J.C.: Coercion and type inference. In: 11th Principles of Programming Languages. (1984)
7. Cardelli, L.: A semantics of multiple inheritance. Information and Computation 76 (1988)
8. Tiuryn, J.: Subtype inequalities. In: 7th IEEE Symposium on Logic in Computer Science. (1992)
9. Hoang, M., Mitchell, J.C.: Lower bounds on type inference with subtypes. In: 22nd Principles of Programming Languages. (1995)
10. Mitchell, J.C.: Type inference with simple subtypes. Journal of Functional Programming 1 (1991)
11. Fuh, Y.C., Mishra, P.: Type inference with subtypes. In: European Symposium on Programming. Volume 300. (1988)
12. Fuh, Y.C., Mishra, P.: Polymorphic subtype inference: Closing the theory-practice gap. In: European Joint Conference on Theory and Practice of Software Development. Volume 352. (1989)
13. Frey, A.: Satisfying subtype inequalities in polynomial space. In: 4th Static Analysis Symposium. Number 1302 (1997)
14. Kuncak, V., Rinard, M.: Structural subtyping of non-recursive types is decidable. In: 18th IEEE Symposium on Logic in Computer Science. (2003)
15. Aiken, A.S., Fähndrich, M.: Making set-constraint based program analyses scale. Technical Report CSD-96-917, University of California, Berkeley (1996)
16. Trifonov, V., Smith, S.: Subtyping constrained types. In: 3rd Static Analysis Symposium. Volume 1145. (1996)
17. Flanagan, C., Felleisen, M.: Componential set-based analysis. In: Programming Language Design and Implementation. (1997)
18. Pottier, F.: Simplifying subtyping constraints: a theory. Information and Computation 170 (2001)
19. Rehof, J.: Minimal typings in atomic subtyping. In: 24th Principles of Programming Languages. (1997)
20. Marlow, S., Wadler, P.: A practical subtyping system for Erlang. In: International Conference on Functional Programming. (1997)
21. F hndrich, M.: Bane, A Library for Scalable Constraint-Based Program Analysis. PhD thesis (1999)
22. ∼fpottier/wallace/ (2000)
23. Frey, A.: Jazz. URL: http://www.exalead.com/jazz/ (1998)
24. Kodumal, J.: Banshee, a toolkit for building constraint-based analyses. PhD thesis (2002)
25. Foster, J.S., Fähndrich, M., Aiken, A.: A Theory of Type Qualifiers. In: Programming Language Design and Implementation. (1999)
26. Foster, J.S., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: Programming Language Design and Implementation. (2002)
27. Glynn, K., Stuckey, P.J., Sulzmann, M., Søndergaard, H.: Boolean constraints for binding-time analysis. In: Programs as Data Objects. Volume 2053. (2001)
28. ∼simonet/soft/dalton/ (2002)
29. Heintze, N., McAllester, D.: Linear-time subtransitive control flow analysis. In: Programming Language Design and Implementation. (1997)
30. Saha, B., Heintze, N., Oliva, D.: Subtransitive CFA using types. Technical report, Yale University (1998)
31. Rémy, D.: Extending ML type system with a sorted equational theory. Research Report 1766, Institut de Recherche en Informatique et en Automatique (1992)
32. Pessaux, F., Leroy, X.: Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems 22 (2000)
33. Simonet, V.: Type inference with structural subtyping: A precise formalization of an efficient constraint solver. Full version. http://cristal.inria.fr/ simonet/publis/simonet-structural-subtyping-full.ps.gz (2003)
34. Abadi, M., Banerjee, A., Heintze, N., Riecke, J.G.: A core calculus of dependency. In: 26th Principles of Programming Languages. (1999)
35. Pottier, F.: A constraint-based presentation and generalization of rows. In: 18th IEEE Symposium on Logic in Computer Science. (2003)
36. Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22 (1975)
37. F hndrich, M., Foster, J.S., Su, Z., Aiken, A.S.: Partial online cycle elimination in inclusion constraint graphs. In: Programming Language Design and Implementation. (1998)
38. Eifrig, J., Smith, S., Trifonov, V.: Sound polymorphic type inference for objects. ACM SIGPLAN Notices 30 (1995)
39. ∼simonet/soft/flowcaml/ (2002)
40. F hndrich, M., Rehof, J., Das, M.: Scalable context-sensitive flow analysis using instantiation constraints. In: Programming Language Design and Implementation. (2000)