, Unify and conquer (garbage, updating, aliasing, . . . ) in functional languages, Lisp and Functional Programming, 1990.
DOI : 10.1145/91556.91652
, Making set-constraint based program analyses scale, 1996.
, Program analysis using mixed term and set constraints, Static Analysis Symposium '97, number 1302 in LNCS, pp.114-126, 1997.
DOI : 10.1007/BFb0032737
, Tracking down exceptions in Standard ML programs, 1998.
, Partial online cycle elimination in inclusion constraint graphs, pp.85-96, 1998.
, Componential set-based analysis, Prog. Lang. Design and Impl, 1997.
DOI : 10.1145/316686.316703
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.6615
, Refinement types for ML, Prog. Lang. Design and Impl, pp.268-277, 1991.
DOI : 10.1145/113445.113468
, A type system for exceptions, Proc. 1994 workshop on ML and its applications, pp.127-135, 1994.
, Set-based analysis of ML programs, Lisp and Functional Programming '94, pp.306-317, 1994.
DOI : 10.1145/182409.182495
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA270597
, Global tagging optimization by type inference, Lisp and Functional Programming, 1992.
DOI : 10.1145/141478.141542
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.6583
, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems, vol.15, issue.2, pp.253-289, 1993.
DOI : 10.1145/169701.169692
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.430
, Polymorphic splitting: An effective polyvariant flow analysis, ACM Trans. Prog. Lang. Syst, vol.20, issue.1, pp.166-207, 1998.
, Type reconstruction in the presence of polymorphic recursion, ACM Transactions on Programming Languages and Systems, vol.15, issue.2
DOI : 10.1145/169701.169687
, Type-based analysis of uncaught exceptions, ACM Transactions on Programming Languages and Systems, vol.22, issue.2, 1998.
DOI : 10.1145/349214.349230
URL : https://hal.archives-ouvertes.fr/hal-01499959
, The Objective Caml system. Software and documentation available on the Web, 1996.
, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.47-57, 1988.
DOI : 10.1145/73560.73564
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.4916
, Polymorphic type schemes and recursive definitions, International Symposium on Programming , number 167 in LNCS, pp.217-228, 1984.
DOI : 10.1007/3-540-12925-1_41
, A polymorphic record calculus and its compilation, ACM Transactions on Programming Languages and Systems, vol.17, issue.6, pp.844-895, 1995.
DOI : 10.1145/218570.218572
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4611
, A framework for type inference with subtyping, Int. Conf. on Functional Progr, pp.228-238, 1996.
DOI : 10.1145/291251.289448
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.2364
, Type inference in the presence of subtyping: from theory to practice, Research report, vol.3483, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073205
, Objective ML, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.40-53, 1997.
DOI : 10.1145/263699.263707
, Records and variants as a natural extension of ML, 16th symp. Principles of Progr. Lang, pp.77-88, 1989.
, Syntactic theories and the algebra of record terms, 1993.
, Type inference for records in a natural extension of ML, Theoretical Aspects of Object-Oriented Programming, 1993.
, Smartest recompilation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.439-450, 1993.
DOI : 10.1145/158511.158702
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.8113
, Control-Flow Analysis of Higher-Order Languages, 1991.
, Points-to analysis in almost linear time, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.32-41, 1996.
DOI : 10.1145/237721.237727
, The Type and Effect Discipline, Information and Computation, vol.111, issue.2, pp.245-296, 1994.
DOI : 10.1006/inco.1994.1046
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.5309
, A region inference algorithm, ACM Transactions on Programming Languages and Systems, vol.20, issue.4, 1998.
DOI : 10.1145/291891.291894
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9171
, Region-Based Memory Management, Information and Computation, vol.132, issue.2, pp.109-176, 1997.
DOI : 10.1006/inco.1996.2613
URL : http://doi.org/10.1006/inco.1996.2613
, Complete type inference for simple objects, Logic in Computer Science, pp.37-44, 1987.
DOI : 10.1109/lics.1988.5111
, A practical soft type system for scheme, ACM Transactions on Programming Languages and Systems, vol.19, issue.1, pp.87-152, 1997.
DOI : 10.1145/239912.239917
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.4251
, A Syntactic Approach to Type Soundness, Information and Computation, vol.115, issue.1, pp.38-94, 1994.
DOI : 10.1006/inco.1994.1093
URL : http://doi.org/10.1006/inco.1994.1093
, Simple imperative polymorphism, Lisp and Symbolic Computation, pp.343-356, 1995.
DOI : 10.1007/BF01018828
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5096
, Towards a cost-effective estimation of uncaught exceptions in SML programs, Static Analysis Symposium '97, number 1302 in LNCS, pp.98-113, 1997.
DOI : 10.1007/BFb0032736
, An abstract interpretation for estimating uncaught exceptions in Standard ML programs, Science of Computer Programming, vol.31, issue.1, pp.147-173, 1998.
DOI : 10.1016/S0167-6423(96)00044-5