Inclusion constraints over non-empty sets of trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 345-356

  Müller, Martin ^a   Niehren, Joachim ^a   Podelski, Andreas ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FORESTRY; FORMAL LOGIC; PROBLEM ORIENTED LANGUAGES;

CONCURRENT CONSTRAINT PROGRAMMING; CONSTRAINT SYSTEMS; EXISTING SYSTEMS; INCREMENTAL ALGORITHM; NON-EMPTY SETS; SATISFIABILITY PROBLEMS; SET CONSTRAINTS; TYPE ANALYSIS;

SOFTWARE DESIGN;

EID: 84956995199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030609     Document Type: Conference Paper

References (29)

1. A. Aiken, D. Kozen, and E. Wimmers. Decidability of Systems of Set Constraints with Negative Constraints. Information and Computation, 1995.
2. A. Aiken and E. Wimmers. Solving Systems of Set Constraints. In Proc 7th LICI pp. 329-340. IEEE, 1992.
3. A. Aiken and E. Wimmers. Type Inclusion Constraints and Type Inference. In Proc. 6th FPCA, pp. 31-41. 1993.
4. A. Aiken, E. Wimmers, and T. Lakshman. Soft Typing with Conditional Types. In Proc. 21st POPL. ACM, 1994
5. L. Bachmair, H. Ganzinger, and U. Waldmann. Set Constraints are the Monadic Class. In Proc. 8th LICS, pp. 75-83. IEEE, 1993.
6. H. P. Barendregt. The Type Free Lambda Calculus. In Barwise [7], 1977.
7. J. Barwise, ed. Handbook of Mathematical Logic. Number 90 in Studies in Logic. North-Holland, 1977.
8. D. Basin and H. Ganzinger. Automated Complexity Analysis Based on Ordered Resolution. In 11th LICS. IEEE, 1996.
9. W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. 9th LICS, pp. 128-136. 1994.
10. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXP-TIME. In Proc. 35th FOCS, pp. 642-653. 1994.
11. W. Charatonik and A. Podelski. The Independence Property of a Class of Set Constraints. In Proc. 2nd CP. LNCS 1118, Springer, 1996.
12. H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371-425. 1989.
13. R. Gilleron, S. Tison, and M. Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. In Proc. 34nd FOCS, pp. 372-380. 1993.
14. N. Heintze. Set Based Analysis of ML Programs. Technical Report CMU-CS-93-193, School of Computer Science, Carnegie Mellon University. July 1993.
15. N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints (Extended Abstract). In Proc. 3th LICS, pp. 42-51. IEEE, 1990.
16. D. Kozen. Logical aspects of set constraints. In Proc. CSL, pp. 175-188. 1993.
17. M. J. Maher. Logic semantics for a class of committed-choice programs. In J.-L. Lassez, ed., Proc. Ąth ICLP, pp. 858-876. The MIT Press, 1987.
18. M. J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In Proc. 3rd LICS, pp. 348-457. IEEE, 1988.
19. A. I. Maic’ev. Axiomatizable Classes of Locally Free Algebras of Various Type. In The Metamathematics of Algebraic Systens: Collected Papers 1936-1967, ch. 23, pp. 262-281. North-Holland, 1971.
20. D. McAllester. Automatic Recognition of Tractability in Inference Relations. Journal of the ACM, 40(2), Apr. 1993.
21. D. McAllester and R. Givan. Taxonomie Syntax for First-Order Inference. Journal of the ACM, 40(2), Apr. 1993.
22. D. McAllester, R. Givan, D. Kozen, and C. Witty. Tarskian Set Constraints. In Proc. 11th LICS. IEEE, 1996.
23. M Müller Type Analysis for a Higher-Order Concurrent Constraint Language. ‘ Doctoral Dissertation. Universität des Saarlandes, Technische Fakultät, 66041 Saarbrücken, Germany. In preparation.
24. M Müller, J. Niehren, and A. Podelski. Inclusion Constraints over Non-Empty Sets of Trees. Full version: http://www.ps.uni-sb.de/Papers/ines97.html.
25. J. Niehren. Functional Computation as Concurrent Computation. In 23" POPL, pp. 333-343. ACM, 1996.
26. J. Niehren and M. Müller. Constraints for Free in Concurrent Computation. In Proc 1st ASIAN, LNCS 1023, pp. 171-186. Springer, 1995.
27. The Oz Programming System. Programming Systems Lab, Universität des baar-landes. Available at http://www.ps.uni-sb.de/www/ozA
28. V A Saraswat. Concurrent Constraint Programming. The Mil fress, 1993.
29. G Smolka. The Oz Programming Model. In J. van Leeuwen, ed., Computer Scence Today, LNCS 1000, pp. 324-343. Springer, 1995.