R. 1. Aiken, D. Kozen, and E. Wimmers, Decidability of Systems of Set Constraints with Negative Constraints. Information and Computation, 1995.

A. Aiken and E. Wimmers, Solving systems of set constraints, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, 1992.
DOI : 10.1109/LICS.1992.185545

A. Aiken and E. Wimmers, Type inclusion constraints and type inference, Proceedings of the conference on Functional programming languages and computer architecture , FPCA '93, pp.31-41, 1993.
DOI : 10.1145/165180.165188

A. Aiken, E. Wimmers, and T. Lakshman, Soft typing with conditional types, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, 1994.
DOI : 10.1145/174675.177847

L. Bachmair, H. Ganzinger, and U. Waldmann, Set constraints are the monadic class, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.75-83, 1993.
DOI : 10.1109/LICS.1993.287598

H. P. Barendregt, The Type Free Lambda Calculus, Barwise 7], 1977.
DOI : 10.1016/S0049-237X(08)71129-7

D. Basin and H. Ganzinger, Automated complexity analysis based on ordered resolution, 11 th LICS, 1996.
DOI : 10.1145/363647.363681

W. Charatonik and L. Pacholski, Negative set constraints with equality, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pp.128-136, 1994.
DOI : 10.1109/LICS.1994.316078

W. Charatonik and L. Pacholski, Set constraints with projections are in NEXP- TIME, Proc. 35 th FOCS, pp.642-653, 1994.

W. Charatonik and A. Podelski, The independence property of a class of set constraints, Proc. 2nd CP. LNCS 1118, 1996.
DOI : 10.1007/3-540-61551-2_67

H. Comon and P. Lescanne, Equational problems anddisunification, Journal of Symbolic Computation, vol.7, issue.3-4, pp.371-425, 1989.
DOI : 10.1016/S0747-7171(89)80017-3

R. Gilleron, S. Tison, and M. Tommasi, Solving systems of set constraints with negated subset relationships, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp.372-380, 1993.
DOI : 10.1109/SFCS.1993.366850
URL : https://hal.archives-ouvertes.fr/inria-00538879

N. Heintze, Set Based Analysis of ML Programs, 1993.

N. Heintze and J. Jaaar, A Decision Procedure for a Class of Set Constraints (Extended Abstract), Proc. 5 th LICS, pp.42-51, 1990.

D. Kozen, Logical aspects of set constraints, Proc. CSL, pp.175-188, 1993.
DOI : 10.1007/BFb0049332

M. J. Maher, Logic semantics for a class of committed-choice programs

M. J. Maher, Complete Axiomatizations of the Algebras of Finite, Rational and Innnite Trees, Proc. 3 rd LICS, pp.348-457, 1988.

A. I. Malc-'ev, Axiomatizable Classes of Locally Free Algebras of Various Type, The Metamathematics of Algebraic Systens: Collected Papers 262{281. North{Holland, 1936.

D. Mcallester, Automatic recognition of tractability in inference relations, Journal of the ACM, vol.40, issue.2, 1993.
DOI : 10.1145/151261.151265

D. Mcallester and R. Givan, Taxonomic syntax for first order inference, Journal of the ACM, vol.40, issue.2, 1993.
DOI : 10.1145/151261.151264

D. Mcallester, R. Givan, D. Kozen, and C. Witty, Tarskian set constraints, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996.
DOI : 10.1109/LICS.1996.561313

M. M. Uller, Type Analysis for a Higher-Order Concurrent Constraint Language. Doctoral Dissertation

J. Niehren, Functional computation as concurrent computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.333-343, 1996.
DOI : 10.1145/237721.237801
URL : https://hal.archives-ouvertes.fr/inria-00536819

J. Niehren and M. M. Uller, Constraints for free in concurrent computation, Proc. 1 st ASIAN, pp.171-186, 1995.
DOI : 10.1007/3-540-60688-2_43
URL : https://hal.archives-ouvertes.fr/inria-00536813

. Proof, Given a B-closed constraint ', we deene the set of variables in ' which are constrained to be non-empty