{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:20Z","timestamp":1725530180798},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_8","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T01:13:03Z","timestamp":1238116383000},"page":"92-106","source":"Crossref","is-referenced-by-count":8,"title":["Dependency Tree Automata"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nested structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11817963_31","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2006","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of nested trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 329\u2013342. Springer, Heidelberg (2006)"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1093\/oso\/9780198537618.003.0002","volume-title":"Handbook of Logic in Computer Science","author":"H. Barendregt","year":"1992","unstructured":"Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 118\u2013309. Oxford University Press, Oxford (1992)"},{"unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Draft Book (2002), http:\/\/l3ux02.univ-lille3.fr\/tata\/","key":"8_CR4"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BFb0028013","volume-title":"Computer Science Logic","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Higher-order matching and tree automata. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 157\u2013176. Springer, Heidelberg (1998)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-45413-6_20","volume-title":"Typed Lambda Calculi and Applications","author":"T. Joly","year":"2001","unstructured":"Joly, T.: The finitely generated types of the lambda calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 240\u2013252. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Procs. LICS 2006, pp. 81\u201390 (2006); (Longer version available from Ong\u2019s web page, 55 pages (preprint, 2006)","key":"8_CR7","DOI":"10.1109\/LICS.2006.38"},{"doi-asserted-by":"crossref","unstructured":"Padovani, V.: Decidability of fourth-order matching. Mathematical Structures in Computer Science, vol.\u00a010(3), pp. 361\u2013372 (2001)","key":"8_CR8","DOI":"10.1017\/S0960129500003108"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BFb0030617","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"A. Schubert","year":"1997","unstructured":"Schubert, A.: Linear interpolation for the higher-order matching problem. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 441\u2013452. Springer, Heidelberg (1997)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2307\/2273377","volume":"47","author":"R. Statman","year":"1982","unstructured":"Statman, R.: Completeness, invariance and \u03bb-definability. The Journal of Symbolic Logic\u00a047, 17\u201326 (1982)","journal-title":"The Journal of Symbolic Logic"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11538363_10","volume-title":"Computer Science Logic","author":"C. Stirling","year":"2005","unstructured":"Stirling, C.: Higher-order matching and games. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 119\u2013134. Springer, Heidelberg (2005)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11787006_30","volume-title":"Automata, Languages and Programming","author":"C. Stirling","year":"2006","unstructured":"Stirling, C.: A game-theoretic approach to deciding higher-order matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 348\u2013359. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Stirling, C.: Higher-order matching, games and automata. In: Procs. LICS 2007, pp. 326\u2013335 (2007)","key":"8_CR14","DOI":"10.1109\/LICS.2007.23"},{"key":"8_CR15","first-page":"117","volume":"13","author":"K. St\u00f8vring","year":"2006","unstructured":"St\u00f8vring, K.: Higher-order beta matching with solutions in long beta-eta normal form. Nordic Journal of Computing\u00a013, 117\u2013126 (2006)","journal-title":"Nordic Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T04:14:30Z","timestamp":1710216870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}