{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:46:13Z","timestamp":1649079973405},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6407,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1016\/0304-3975(96)00070-9","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"73-94","source":"Crossref","is-referenced-by-count":3,"title":["Rational spaces and set constraints"],"prefix":"10.1016","volume":"167","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00070-9_bib1","series-title":"Proc. 1993 Conf. Computer Science Logic (CSL'93)","first-page":"1","article-title":"The complexity of set constraints","volume":"Vol. 832","author":"Aiken","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1006\/inco.1995.1139","article-title":"Decidability of systems of set constraints with negative constraints","volume":"122","author":"Aiken","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(96)00070-9_bib3","series-title":"Proc. 1991 Conf. Functional Programming Languages and Computer Architecture","first-page":"427","article-title":"Implementing regular tree expressions","author":"Aiken","year":"1991"},{"key":"10.1016\/0304-3975(96)00070-9_bib4","series-title":"Proc. 18th ACM Symp. Principles of Programming Languages","first-page":"279","article-title":"Static type inference in a dynamically typed language","author":"Aiken","year":"1991"},{"key":"10.1016\/0304-3975(96)00070-9_bib5","series-title":"Proc. 7th. IEEE Symp. Logic in Computer Science","first-page":"329","article-title":"Solving systems of set constraints","author":"Aiken","year":"1992"},{"key":"10.1016\/0304-3975(96)00070-9_bib6","series-title":"Proc. 8th IEEE Symp. Logic in Computer Science","first-page":"75","article-title":"Set constraints are the monadic class","author":"Bachmair","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib7","series-title":"Proc. 9th IEEE Symp. Logic in Computer Science","first-page":"128","article-title":"Negative set constraints with equality","author":"Charatonik","year":"1994"},{"key":"10.1016\/0304-3975(96)00070-9_bib8","series-title":"Proc. 35th IEEE Symp. Foundations of Computer Science","first-page":"642","article-title":"Set constraints with projections are in NEXPTIME","author":"Charatonik","year":"1994"},{"key":"10.1016\/0304-3975(96)00070-9_bib9","article-title":"A complete Gentzen-style axiomatization for set constraints","author":"Cheng","year":"1995"},{"key":"10.1016\/0304-3975(96)00070-9_bib10","article-title":"Tree automata and tree grammars","author":"Englefriet","year":"1975"},{"key":"10.1016\/0304-3975(96)00070-9_bib11","series-title":"Proc. Symp. Theor. Aspects of Comput. Sci.","first-page":"505","article-title":"Solving systems of set constraints using tree automata","volume":"Vol. 665","author":"Gilleron","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib12","series-title":"Proc. 34th IEEE Symp. Foundations of Comput. Sci.","first-page":"372","article-title":"Solving systems of set constraints with negated subset relationships","author":"Gilleron","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib13","article-title":"Set based program analysis","author":"Heintze","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib14","series-title":"Proc. 5th IEEE Symp. Logic in Computer Science","first-page":"42","article-title":"A decision procedure for a class of set constraints","author":"Heintze","year":"1990"},{"key":"10.1016\/0304-3975(96)00070-9_bib15","series-title":"Proc. 17th ACM Symp. Principles of Programming Languages","first-page":"197","article-title":"A finite presentation theorem for approximating logic programs","author":"Heintze","year":"1990"},{"key":"10.1016\/0304-3975(96)00070-9_bib16","series-title":"Proc. 6th ACM Symp. Principles of Programming Languages","first-page":"244","article-title":"Flow analysis and optimization of LISP-like structures","author":"Jones","year":"1979"},{"key":"10.1016\/0304-3975(96)00070-9_bib17","doi-asserted-by":"crossref","first-page":"891","DOI":"10.2307\/2372123","article-title":"Boolean algebras with operators","volume":"73","author":"Jo\u00b4nsson","year":"1951","journal-title":"Amer. J. Math."},{"key":"10.1016\/0304-3975(96)00070-9_bib18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/2372074","article-title":"Boolean algebras with operators","volume":"74","author":"Jo\u00b4nsson","year":"1952","journal-title":"Amer. J. Math."},{"key":"10.1016\/0304-3975(96)00070-9_bib19","series-title":"Proc. 1993 Conf. Computer Science Logic (CSL'93)","first-page":"175","article-title":"Logical aspects of set constraints","volume":"Vol. 832","author":"Kozen","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib20","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0016861","article-title":"Set constraints and logic programming","author":"Kozen","year":"1994"},{"key":"10.1016\/0304-3975(96)00070-9_bib21","series-title":"Proc. 1st ESPRIT Conf. Constraints in Computational Logics (CCL'94)","first-page":"302","article-title":"Set constraints and logic programming","volume":"Vol. 845","author":"Kozen","year":"1994"},{"key":"10.1016\/0304-3975(96)00070-9_bib22","series-title":"Proc. 6th Int. Joint Conf. Theory and Practice of Software Develop. (TAPSOFT'95)","first-page":"42","article-title":"Rational spaces and set constraints","volume":"Vol. 915","author":"Kozen","year":"1995"},{"key":"10.1016\/0304-3975(96)00070-9_bib23","series-title":"Proc. 20th ACM Symp. Principles of Programming Languages","first-page":"419","article-title":"Efficient recursive subtyping","author":"Kozen","year":"1993"},{"key":"10.1016\/0304-3975(96)00070-9_bib24","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0022-0000(05)80051-0","article-title":"Efficient inference of partial types","volume":"49","author":"Kozen","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(96)00070-9_bib25","series-title":"Proc. 1st IEEE Symp. Logic Programming","first-page":"289","article-title":"Towards a theory of types in PROLOG","author":"Mishra","year":"1984"},{"key":"10.1016\/0304-3975(96)00070-9_bib26","series-title":"Proc. 12th ACM Symp. Principles of Programming Languages","first-page":"7","article-title":"Declaration-free type checking","author":"Mishra","year":"1985"},{"key":"10.1016\/0304-3975(96)00070-9_bib27","series-title":"Information Processing 68","first-page":"456","article-title":"Automatic computation of data set definitions","author":"Reynolds","year":"1969"},{"key":"10.1016\/0304-3975(96)00070-9_bib28","series-title":"Proc. 9th IEEE Symp. Logic in Computer Science","first-page":"137","article-title":"Systems of set constraints with negative constraints are NEXPTIME-complete","author":"Stefa\u00b4nsson","year":"1994"},{"key":"10.1016\/0304-3975(96)00070-9_bib29","series-title":"Partial Evaluation and Mixed Computation","first-page":"573","article-title":"Experience with a type evaluator","author":"Young","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000709?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000709?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:12Z","timestamp":1555390572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596000709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996]]}},"alternative-id":["0304397596000709"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00070-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}