Abstract
Set constraints are inclusions between expressions denoting sets of ground terms. They have been used extensively in program analysis and type inference. In this paper we investigate the topological structure of the spaces of solutions to systems of set constraints. We identify a family of topological spaces called rational spaces, which formalize the notion of a topological space with a regular or self-similar structure, such as the Cantor discontinuum or the space of runs of a finite automaton. We develop the basic theory of rational spaces and derive generalizations and proofs from topological principles of some results in the literature on set constraints.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Aiken, D. Kozen, M. Vardi, and E. Wimmers, The complexity of set constraints, in Proc. 1993 Conf. Computer Science Logic (CSL'93), E. Börger, Y. Gurevich, and K. Meinke, eds., vol. 832 of Lect. Notes in Comput. Sci., Eur. Assoc. Comput. Sci. Logic, Springer, September 1993, pp. 1–17.
A. Aiken, D. Kozen, and E. Wimmers, Decidability of systems of set constraints with negative constraints, Infor. and Comput., (1995). To appear. Also Cornell University Tech. Report 93–1362, June, 1993.
A. Aiken and B. Murphy, Implementing regular tree expressions, in Proc. 1991 Conf. Functional Programming Languages and Computer Architecture, August 1991, pp. 427–447.
Static type inference in a dynamically typed language, in Proc. 18th Symp. Principles of Programming Languages, ACM, January 1991, pp. 279–290.
A. Aiken and E. Wimmers, Solving systems of set constraints, in Proc. 7th Symp. Logic in Computer Science, IEEE, June 1992, pp. 329–340.
L. Bachmair, H. Ganzinger, and U. Waldmann, Set constraints are the monadic class, in Proc. 8th Symp. Logic in Computer Science, IEEE, June 1993, pp. 75–83.
W. Charatonik and L. Pacholski, Negative set constraints with equality, in Proc. 9th Symp. Logic in Computer Science, IEEE, July 1994, pp. 128–136.
Set constraints with projections are in NEXPTIME, in Proc. 35th Symp. Foundations of Computer Science, IEEE, November 1994, pp. 642–653.
J. Englefriet, Tree automata and tree grammars, Tech. Rep. DAIMI FN-10, Aarhus University, April 1975.
R. Gilleron, S. Tison, and M. Tommasi, Solving systems of set constraints using tree automata, in Proc. Symp. Theor. Aspects of Comput. Sci., vol. 665, Springer-Verlag Lect. Notes in Comput. Sci., February 1993, pp. 505–514.
Solving systems of set constraints with negated subset relationships, in Proc. 34th Symp. Foundations of Comput. Sci., IEEE, November 1993, pp. 372–380.
N. Heintze, Set Based Program Analysis, PhD thesis, Carnegie Mellon University, 1993.
N. Heintze and J. Jaffar, A decision procedure for a class of set constraints, in Proc. 5th Symp. Logic in Computer Science, IEEE, June 1990, pp. 42–51.
A finite presentation theorem for approximating logic programs, in Proc. 17th Symp. Principles of Programming Languages, ACM, January 1990, pp. 197–209.
N. D. Jones and S. S. Muchnick, Flow analysis and optimization of LISP-like structures, in Proc. 6th Symp. Principles of Programming Languages, ACM, January 1979, pp. 244–256.
B. Jónsson and A. Tarski, Boolean algebras with operators, Amer. J. Math., 73 (1951), pp. 891–939.
, Boolean algebras with operators, Amer. J. Math., 74 (1952), pp. 127–162.
D. Kozen, Logical aspects of set constraints, in Proc. 1993 Conf. Computer Science Logic (CSL'93), E. Börger, Y. Gurevich, and K. Meinke, eds., vol. 832 of Lect. Notes in Comput. Sci., Eur. Assoc. Comput. Sci. Logic, Springer, September 1993, pp. 175–188.
Set constraints and logic programming (abstract), in Proc. First Conf. Constraints in Computational Logics (CCL'94), J.-P. Jouannaud, ed., vol. 845 of Lect. Notes in Comput. Sci., ESPRIT, Springer, September 1994, pp. 302–303. Full version available as: Set constraints and logic programming, Tech. Rep. 94–1467, Cornell University, November 1994.
D. Kozen, J. Palsberg, and M. I. Schwartzbach, Efficient recursive subtyping, in Proc. 20th Symp. Princip. Programming Lang., ACM, January 1993, pp. 419–428.
, Efficient inference of partial types, J. Comput. Syst. Sci., 49 (1994), pp. 306–324.
P. Mishra, Towards a theory of types in PROLOG, in Proc. 1st Symp. Logic Programming, IEEE, 1984, pp. 289–298.
P. Mishra and U. Reddy, Declaration-free type checking, in Proc. 12th Symp. Principles of Programming Languages, ACM, 1985, pp. 7–21.
J. C. Reynolds, Automatic computation of data set definitions, in Information Processing 68, North-Holland, 1969, pp. 456–461.
K. Stefánsson, Systems of set constraints with negative constraints are NEXPTIME-complete, in Proc. 9th Symp. Logic in Computer Science, IEEE, June 1994, pp. 137–141.
J. Young and P. O'keefe, Experience with a type evaluator, in Partial Evaluation and Mixed Computation, D. Bjørner, A. P. Ershov, and N. D. Jones, eds., North-Holland, 1988, pp. 573–581.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kozen, D. (1995). Rational spaces and set constraints. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_186
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_186
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive