A complete gentzen-style axiomatization for set constraints

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

Volumn 1099, Issue , 1996, Pages 134-145

  Cheng, Allan ^a   Kozen, Dexter ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

AXIOMATIZATION; DEDUCTIVE SYSTEMS; FINITE SET; GROUND TERMS; INCLUSION RELATION; PROGRAM ANALYSIS; SET CONSTRAINTS; STANDARD MODEL;

AUTOMATA THEORY;

EID: 84947762838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_123     Document Type: Conference Paper

References (31)

1. Alexander Aiken, Dexter Kozen, Moshe Vardi, and Edward Wimmers. The complexity of set constraints. In E. Börger, Y. Gurevich, and K. Meinke, editors, Proc. 1993 Conf. Computer Science Logic (CSL'93), volume 832 of Lect. Notes in Comput. Sei., pages 1-17. Eur. Assoc. Comput. Sei. Logic, Springer, September 1993.
2. Alexander Aiken, Dexter Kozen, and Edward Wimmers. Decidability of systems of set constraints with negative constraints. Infor. and Comput., 122(1):30-44, October 1995.
3. A. Aiken and B. Murphy. Implementing regular tree expressions. In Proc. 1991 Conf. Functional Programming Languages and Computer Architecture, pages 427-447, August 1991.
4. A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Proc. 18th Symp. Principles of Programming Languages, pages 279-290. ACM, January 1991.
5. A. Aiken and E. Wimmers. Solving systems of set constraints. In Proc. 7th Symp. Logic in Computer Science, pages 329-340. IEEE, June 1992.
6. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Proc. 8th Symp. Logic in Computer Science, pages 7583. IEEE, June 1993.
7. A. Cheng and D. Kozen. A Complete Gentzen-style Axiomatization for Set Constraints. Tech. Rep. 95-1518, Computer Science Department, Cornell University, May 1995.
8. A. Colmerauer. PROLOG and infinite trees. In S.-Ä. Tärnlund and K. L. Clark, editors, Logic Programming, pages 231-251. Academic Press, January 1982.
9. Bruno Courcelle. Fundamental properties of infinite trees. Theor. Comput. Sei., 25:95-169, 1983.
10. W. Charatonik and L. Pacholski. Negative set constraints with equality. In Proc. 9th Symp. Logic in Computer Science, pages 128-136. IEEE, July 1994.
11. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Proc. 35th Symp. Foundations of Computer Science, pages 642-653. IEEE, November 1994.
12. Timothy G. Griffin. An environment for formal systems. Technical Report TR87-846, Cornell University, June 1987.
13. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In Proc. Symp. Theor. Aspects of Comput. Sei., volume 665, pages 505-514. Springer-Verlag Lect. Notes in Comput. Sei., February 1993.
14. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proc. 34th Symp. Foundations of Comput. Sei., pages 372-380. IEEE, November 1993.
15. Nevin Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, 1993.
16. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints. In Proc. 5th Symp. Logic in Computer Science, pages 42-51. IEEE, June 1990.
17. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Proc. 17th Symp. Principles of Programming Languages, pages 197-209. ACM, January 1990.
18. N. D. Jones and S. S. Muchnick. Flow analysis and optimization of LISPlike structures. In Ρ roc. 6th Symp. Principles of Programming Languages, pages 244-256. ACM, January 1979.
19. B. Jónsson and A. Tarski. Boolean algebras with operators. Amer. J. Math., 73:891-939, 1951.
20. B. Jónsson and A. Tarski. Boolean algebras with operators. Amer. J. Math., 74:127-162, 1952.
21. Dexter Kozen. Logical aspects of set constraints. In E. Borger, Y. Gurevich, and K. Meinke, editors, Proc. 1993 Conf. Computer Science Logic (CSL'93), volume 832 of Led. Notes in Comput. Sei., pages 175-188. Eur. Assoc. Comput. Sei. Logic, Springer, September 1993.
22. Dexter Kozen. Set constraints and logic programming (abstract). In J.-P. Jouannaud, editor, Proc. First Conf. Constraints in Computational Logics (CCL'94), volume 845 of Lect. Notes in Comput. Sei., pages 302-303. ESPRIT, Springer, September 1994.
23. Dexter Kozen. Rational spaces and set constraints. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors, Proc. Sixth Int. Joint Conf. Theory and Practice of Software Develop. (TAPSOFT'95), volume 915 of Lect. Notes in Comput. Sei., pages 42-61. Springer, May 1995.
24. Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient inference of partial types. In Proc. 33rd Symp. Found. Comput. Sei., pages 363-371. IEEE, October 1992.
25. Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient recursive subtyping. In Proc. 20th Symp. Princip. Programming Lang., pages 419-428. ACM, January 1993.
26. Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient inference of partial types. J. Comput. Syst. Sei., 49(2):306-324, October 1994.
27. P. Mishra. Towards a theory of types in PROLOG. In Proc. 1st Symp. Logic Programming, pages 289-298. IEEE, 1984.
28. P. Mishra and U. Reddy. Declaration-free type checking. In Proc. 12th Symp. Principles of Programming Languages, pages 7-21. ACM, 1985.
29. J. C. Reynolds. Automatic computation of data set definitions. In Information Processing 68, pages 456-461. North-Holland, 1969.
30. K. Stefänsson. Systems of set constraints with negative constraints are NEXPTIME-complete. In Proc. 9th Symp. Logic in Computer Science, pages 137-141. IEEE, June 1994.
31. J. Young and P. O'Keefe. Experience with a type evaluator. In D. BjØrner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 573-581. North-Holland, 1988.