{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:32Z","timestamp":1725663572383},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:43:43Z","timestamp":1330209823000},"page":"427-447","source":"Crossref","is-referenced-by-count":34,"title":["Implementing regular tree expressions"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Aiken","sequence":"first","affiliation":[]},{"given":"Brian R.","family":"Murphy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"21_CR1","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, Orlando, 1991.","DOI":"10.1145\/99583.99621"},{"key":"21_CR2","unstructured":"A. Aiken and E. Wimmers. A decision problem for set constraints. Research Report Forthcoming RJ, IBM, 1991."},{"key":"21_CR3","unstructured":"J. Backus et al. FL language manual, parts 1 and 2. Research Report RJ 7100, IBM, 1989."},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95\u2013169, 1983.","journal-title":"Theoretical Computer Science"},{"key":"21_CR5","volume-title":"Tree Automata","author":"F. Gecseg","year":"1984","unstructured":"F. Gecseg and M. Steinby. Tree Automata. Academei Kaido, Budapest, 1984."},{"key":"21_CR6","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":"21_CR7","unstructured":"N. Heintze and J. Jaffar. Set-based program analysis. Draft manuscript, 1991."},{"key":"21_CR8","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"21_CR9","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":"21_CR10","doi-asserted-by":"crossref","unstructured":"D. Michie. \u2018Memo\u2019 functions and machine learning. Nature, (218):19\u201322, April 1968.","DOI":"10.1038\/218019a0"},{"key":"21_CR11","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":"21_CR12","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":"21_CR13","unstructured":"B. R. Murphy. A type inference system for FL. Master's thesis, MIT, 1990."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"H. Seidl. Deciding equivalence of finite tree automata. In 6th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, February 1989.","DOI":"10.1007\/BFb0029009"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:55Z","timestamp":1605646435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3540543961_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}