Inclusion Constraints over Non-empty Sets of Trees

We present a new constraint system called Ines. Its constraints are conjunctions of inclusions \(t_1 \subseteq t_2\)between first-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express Ines constraints only if they include negation. Their satisfiability problem is NEXPTIME-complete. We present an incremental algorithm that solves the satisfiability problem of Ines constraints in cubic time. We intend to apply Ines constraints for type analysis for a concurrent constraint programming language.

[1]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[2]  Gert Smolka,et al.  Encapsulated Search and Constraint Programming in Oz , 1994, PPCP.

[3]  J. Palsberg.  Eecient Inference of Object Types , 1995 .

[4]  Luca Cardelli,et al.  Subtyping recursive types , 1991, POPL '91.

[5]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[6]  Andreas Podelski,et al.  Towards a Meaning of LIFE , 1991, J. Log. Program..

[7]  Joachim Niehren,et al.  Constraints for Free in Concurrent Computation , 1995, ASIAN.

[8]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

[9]  Andreas Podelski,et al.  The Independence Property of a Class of Set Constraints , 1996, CP.

[10]  A. I. Malcev.  Axiomatizable classes of locally free algebras of various types , 1971 .

[11]  Joachim Niehren,et al.  Functional computation as concurrent computation , 1996, POPL '96.

[12]  Michael J. Maher.  Logic Semantics for a Class of Committed-Choice Programs , 1987, ICLP.

[13]  Nevin Heintze.  Practical Aspects of Set Based Analysis , 1992, JICSLP.

[14]  Satish R. Thatte.  Quasi-static typing , 1989, POPL '90.

[15]  Witold Charatonik,et al.  Negative set constraints with equality , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[16]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[17]  Gert Smolka,et al.  A Feature-Based Constraint System for Logic Programming with Entailment , 1992, FGCS.

[18]  Nevin Heintze,et al.  Set-based analysis of ML programs , 1994, LFP '94.

[19]  Dexter Kozen.  Logical Aspects of Set Constraints , 1993, CSL.

[20]  Alexander Aiken,et al.  Type inclusion constraints and type inference , 1993, FPCA '93.

[21]  Robert Givan,et al.  Taxonomic syntax for first order inference , 1989, JACM.

[22]  Michael J. Maher.  Complete axiomatizations of the algebras of finite, rational and infinite trees , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[23]  Witold Charatonik,et al.  Set constraints with projections are in NEXPTIME , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[24]  Nevin Charles Heintze,et al.  Set based program analysis , 1992 .

[25]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[26]  Alain Colmerauer,et al.  Equations and Inequations on Finite and Infinite Trees , 1984, FGCS.

[27]  Alexander Aiken,et al.  The Complexity of Set Constraints , 1993, CSL.

[28]  Sophie Tison,et al.  Solving systems of set constraints with negated subset relationships , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[29]  Alexander Aiken,et al.  Soft typing with conditional types , 1994, POPL '94.

[30]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[31]  David A. McAllester.  Automatic recognition of tractability in inference relations , 1993, JACM.

[32]  Joxan Jaffar,et al.  A decision procedure for a class of set constraints , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[33]  Jens Palsberg,et al.  A type system equivalent to flow analysis , 1995, TOPL.

[34]  Jens Palsbergypalsberg,et al.  Eecient Recursive Subtyping , 1993 .

[35]  H. Keisler,et al.  Handbook of mathematical logic , 1977 .

[36]  A. Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994 .

[37]  Gert Smolka.  The Oz Programming Model , 1996 .

[38]  Nicolas Beldiceanu,et al.  Constraint Logic Programming , 1997 .

[39]  Jochen Dörre,et al.  Feature Logic with Weak Subsumption Constraints , 1991, ACL.

[40]  H. Barendregt.  The type free lambda calculus , 1977 .

[41]  D. Kozen,et al.  Ecien t Inference of Partial Types , 1994 .

[42]  Henk Barendregt,et al.  Types in Lambda Calculi and Programming Languages , 1990, ESOP.