{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:27Z","timestamp":1763468067927,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540586012"},{"type":"electronic","value":"9783540490326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58601-6_110","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:25Z","timestamp":1330274245000},"page":"326-335","source":"Crossref","is-referenced-by-count":20,"title":["Set constraints: Results, applications and future directions"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Aiken","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"26_CR1","unstructured":"A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The complexity of set constraints. In Computer Science Logic '93, Swansea, Wales, September 1993. To appear."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Research Report RJ 9421, IBM, 1993.","DOI":"10.7146\/brics.v1i32.21611"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"A. Aiken and T.K. Lakshman. Directional type checking of logic programs. In Proceedings of the 1st International Static Analysis Symposium, September 1994. To appear.","DOI":"10.1007\/3-540-58485-4_32"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279\u2013290, January 1991.","DOI":"10.1145\/99583.99621"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers. Solving systems of set constraints. In Symposium on Logic in Computer Science, pages 329\u2013340, June 1992.","DOI":"10.1109\/LICS.1992.185545"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers. Type inclusion constraints and type inference. In Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture, pages 31\u201341, Copenhagen, Denmark, June 1993.","DOI":"10.1145\/165180.165188"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. Wimmers, and T.K. Lakshman. Soft typing with conditional types. In Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 163\u2013173, Portland, Oregon, January 1994.","DOI":"10.1145\/174675.177847"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Symposium on Logic in Computer Science, pages 75\u201383, June 1993.","DOI":"10.1109\/LICS.1993.287598"},{"key":"26_CR9","unstructured":"W. Charatonik and L. Pacholski. Negative set constraints wtih equality: An easy proof of decidability. In Symposium on Logic in Computer Science, July 1994. To appear."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In Foundations of Computer Science, 1994. To appear.","DOI":"10.1109\/SFCS.1994.365727"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"F. M. Damm. Subtyping with union types, intersection types and recursive types. In Proceedings of the International Symposium on Theoretical Aspects of Computer Software. Springer-Verlag, April 1994. To appear.","DOI":"10.1007\/3-540-57887-0_121"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints using tree automata. In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 505\u2013514, 1992.","DOI":"10.1007\/3-540-56503-5_50"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison, and M. Tommasi. Solving Systems of Set Constraints with Negated Subset Relationships. In Foundations of Computer Science, pages 372\u2013380, November 1993.","DOI":"10.1109\/SFCS.1993.366850"},{"key":"26_CR14","unstructured":"N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, 1992."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set-based analysis of ML programs (extended abstract). In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, June 1994. To appear.","DOI":"10.1145\/182409.182495"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A decision procedure for a class of Herbrand set constraints. In Symposium on Logic in Computer Science, pages 42\u201351, June 1990.","DOI":"10.1109\/LICS.1990.113732"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197\u2013209, January 1990.","DOI":"10.1145\/96709.96729"},{"key":"26_CR18","unstructured":"N. Heintze and J. Jaffar. Set-based program analysis. Draft manuscript, 1991."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. An engine for logic program analysis. In Symposium on Logic in Computer Science, pages 318\u2013328, June 1992.","DOI":"10.1109\/LICS.1992.185544"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"N. D. Jones and S. S. Muchnick. Flow analysis and optimization of LISP-like structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244\u2013256, January 1979.","DOI":"10.1145\/567752.567776"},{"key":"26_CR21","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01458217","volume":"76","author":"L. Lowenheim","year":"1915","unstructured":"L. Lowenheim. Uber moglichkeiten im relativkalk\u00fcl. Math. Annalen, 76:228\u2013251, 1915.","journal-title":"Math. Annalen"},{"key":"26_CR22","unstructured":"P. Mishra. Towards a theory of types in PROLOG. In Proceedings of the First IEEE Symposium in Logic Programming, pages 289\u2013298, 1984."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. Reddy. Declaration-free type checking. In Proceedings of the Twelfth Annual ACM Symposium on the Principles of Programming Languages, pages 7\u201321, 1985.","DOI":"10.1145\/318593.318603"},{"key":"26_CR24","unstructured":"J. C. Reynolds. Automatic Computation of Data Set Definitions, pages 456\u2013461. Information Processing 68. North-Holland, 1969."},{"issue":"3","key":"26_CR25","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"H. Seidl. Deciding equivalence of finite tree automata. SI AM Journal of Computing, 19(3):424\u2013437, June 1990.","journal-title":"SI AM Journal of Computing"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"S. Thatte. Type inference with partial types. In Automata, Languages and Programming: 15th International Colloquium, pages 615\u2013629. Springer-Verlag Lecture Notes in Computer Science, vol. 317, July 1988.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"E. Wang and P. N. Hilfinger. Analysis of recursive types in Lisp-like languages. In Proceedings of the 199S ACM Conference on Lisp and Functional Programming, pages 216\u2013225, June 1992.","DOI":"10.1145\/141471.141544"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58601-6_110.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:36:20Z","timestamp":1742596580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58601-6_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540586012","9783540490326"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-58601-6_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}