R. M. Amadio and L. Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems, vol.15, issue.4, pp.575-631, 1993.
DOI : 10.1145/155183.155231
URL : https://hal.archives-ouvertes.fr/inria-00070035

F. Baader and K. Schulz, Unification in the union of disjoint equational theories: Combining decision procedures, Journal of Symbolic Computation, pp.211-243, 1996.

V. Durnev, Unsolvability of positive ?? 3 -theory of free groups, Sibirsky mathematichesky jurnal Russian, also exists in English translation, pp.1067-1080, 1995.

J. Eifrig, S. Smith, and V. Trifonow, Sound polymorphic type inference for objects, ACM Conference on Object-Oriented Programming: Systems, Languages, and Applications, 1995.

J. Eifrig, S. Smith, and V. Trifonow, Type inference for recursively constrained types and its application to object-oriented programming, Elec. Notes in Theor. Comp. Science, vol.1, 1995.

Y. Fuh and P. Mishra, Type inference with subtypes, Theo. Comp. Science, p.73, 1990.

F. Henglein and J. Rehof, The complexity of subtype entailment for simple types, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.362-372, 1997.
DOI : 10.1109/LICS.1997.614961

F. Henglein and J. Rehof, Constraint automata and the complexity of recursive subtype entailment, 25 th Int. Conf. on Automata, Languages, & Programming, 1998.
DOI : 10.1007/BFb0055089

D. Kozen, J. Palsberg, and M. I. Schwartzbach, Efficient inference of partial types, Journal of Computer and System Sciences, vol.49, issue.2, pp.306-324, 1994.
DOI : 10.1016/S0022-0000(05)80051-0

D. Kozen, J. Palsberg, and M. I. Schwartzbach, Efficient recursive subtyping, Mathematical Structures in Computer Science, vol.5, pp.1-13, 1995.

G. Makanin, THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP, Mathematics of the USSR-Sbornik, vol.32, issue.2, 1977.
DOI : 10.1070/SM1977v032n02ABEH002376

J. C. Mitchell, Abstract, Journal of Functional Programming, vol.17, issue.03, pp.245-285, 1991.
DOI : 10.1016/S0019-9958(82)80087-9

M. Müller, J. Niehren, and R. Treinen, The first-order theory of ordering constraints over feature trees, IEEE Symposium on Logic in Computer Science, pp.432-443, 1998.

J. Niehren, M. Müller, and J. Talbot, Entailment of atomic set constraints is PSPACEcomplete, 14 th IEEE Symposium on Logic in Computer Sience, pp.285-294, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00536817

J. Niehren and T. Priesnitz, Entailment of Non-structural Subtype Constraints, Asian Computing Science Conference, pp.251-265, 1999.
DOI : 10.1007/3-540-46674-6_22
URL : https://hal.archives-ouvertes.fr/inria-00536825

J. Palsberg, M. Wand, and P. O. Keefe, Type inference with non-structural subtyping, Formal Aspects of Computing, vol.5, issue.3, pp.49-67, 1997.
DOI : 10.1007/BF01212524

W. Plandowski, Satisfiability of word equations with constants is in PSPACE, Proc. of the 40 th IEEE Symp. on Found. of Comp. Science, pp.495-500, 1999.

F. Pottier, Simplifying subtyping constraints, Proceedings of the ACM SIGPLAN International Conference on Functional Programming, pp.122-133, 1996.

F. Pottier, A framework for type inference with subtyping, Proc. of the third ACM SIG- PLAN International Conference on Functional Programming, pp.228-238, 1998.

F. Pottier, Type inference in the presence of subtyping: from theory to practice, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073205

J. Rehof, Minimal typings in atomic subtyping, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, 1997.
DOI : 10.1145/263699.263738

J. Rehof, The Complexity of Simple Subtyping Systems, 1998.

K. U. Schulz, Makanin's algorithm for word equations-two improvements and a generalization, Word Equations and Related Topics, pp.85-150, 1991.
DOI : 10.1007/3-540-55124-7_4

Y. Vazhenin and B. Rozenblat, Decidability of the positive theory of a free countably generated semigroup, Math. USSR Sbornik, pp.109-116, 1983.