An extension of HM(X) with bounded existential and universal data-types

ACM SIGPLAN Notices

Volumn 38, Issue 9, 2003, Pages 39-50

  Simonet, Vincent ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

Constraint based type inference; Existential and universal data types; Structural subtyping

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA STRUCTURES; DIFFERENTIATION (CALCULUS);

CONSTRAINT LANGUAGE; INFERENCE ALGORITHMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442337730     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/944746.944710     Document Type: Conference Paper

References (31)

1. A. S. Aiken and M. Fähndrich. Program analysis using mixed term and set constraints. In Static Analysis Symposium, 1997.
2. L. Augustsson. Haskell B. user's manual, 1994.
3. L. Cardelli. An implementation of FSub. Technical Report 97, Digital Equipment Corporation Systems Research Center, 1993.
4. S. Conchon and F. Pottier. JOIN(X): Constraint-based type inference for the join-calculus. In European Symposium on Programming, 2001.
5. J. S. Foster, T. Terauchi, and A. Aiken. Flow-sensitive type qualifiers. In Programming Language Design and Implementation, 2002.
6. Y.-C. Fuh and P. Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In European Joint Conference on Theory and Practice of Software Development, 1989.
7. J. Garrigue and D. Rémy. Extending ML with semi-explicit higher-order polymorphism. Journal of Functional Programming, 155(1/2), 1999.
8. F. Henglein and J. Rehof. The complexity of subtype entailment for simple types. In Symposium on Logic in Computer Science, 1997.
9. M. Hoang and J. C. Mitchell. Lower bounds on type inference with subtypes. In Principles of Programming Languages, 1995.
10. V. Kuncak and M. Rinard. Structural subtyping of non-recursive types is decidable. In Symposium on Logic in Computer Science, 2003.
11. F: Raising ML to the power of system F. In International Conference on Functional Programming, 2003.
12. X. Leroy, D. Dolegez, J. Garrìgue, D. Rémy, and J. Vouillon. The Objective Caml system. http://caml.inria.fr/.
13. M. Mauny and F. Pottier. An implementation of Caml Light with existential types. Research Report 2183, INRIA, 1993.
14. J. Mitchell and G. Plotkin. Abstract types have existential types. ACM Transactions on Programming Languages and Systems, 10(3), 1988.
15. J. C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1(3), 1991.
16. M. Odersky and K. Läufer. An extension of ML with first-class abstract types. In Workshop on ML and its Applications, 1992.
17. M. Odersky and K. Läufer. Putting type annotations to work. In Principles of Programming Languages, 1996.
18. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1), 1999.
19. M. Odersky, C. Zenger, and M. Zenger. Colored local type inference. ACM SIGPLAN Notices, 36(3), 2001.
20. N. Perry. The Implementation of Practicel Functional Programming Languages. PhD thesis, 1990.
21. B. C. Pierce and D. N. Turner. Local type inference. ACM Transactions on Programming Languages and Systems, 22(1), 2000.
22. F. Pottier. A versatile constraint-based type inference system. Nordic Journal of Computing, 7(4), 2000.
23. F. Pottier. A semi-syntactic soundness proof for HM(X). Research Report 4150, INRIA, 2001.
24. F. Pottier and V. Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1), 2003.
25. D. Rémy. Programming objects with ML-ART: An extension to ML with abstract and record types. In Theoretical Aspects of Computer Science, 1994.
26. V. Simonet. Flow Caml, information flow inference in Objective Caml. http://cristal.inria.fr/~simonet/soft/flowcaml/, 2003.
27. V. Simonet. An extension of HM(X) with bounded existential and universal data-types. Full version. http://cristal.inria.fr/~simonet/publis/simonet-ifcp03-full.ps.gz, 2003.
28. V. Simonet. Type inference with structural subtyping: The faithful formalization of an efficient constraint solver. Submitted for publication. http://cristal.inria.fr/~simonet/publis/simonet-structural-subtyping.ps.gz, 2003.
29. M. Sulzmann, M. Odersky, and M. Wehr. Type inference with constrained types. In Workshop on Foundations of Object-Oriented Languages, 1997.
30. J. Tiuryn. Subtype inequalities. In Symposium on Logic in Computer Science, 1992.
31. A. K. Wright. Polymorphism for imperative languages without imperative types. TR 93-200, Rice University, 1993.