{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:12Z","timestamp":1725549192863},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_1","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T20:07:56Z","timestamp":1267992476000},"page":"1-1","source":"Crossref","is-referenced-by-count":0,"title":["Introduction to Decidability of Higher-Order Matching"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","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":"1_CR2","unstructured":"Huet, G.: R\u00e8solution d\u2019\u00e8quations dans les langages d\u2019ordre 1, 2, ... \u03c9. Th\u00e8se de doctorat d\u2019\u00e8tat, Universit\u00e8 Paris VII (1976)"},{"key":"1_CR3","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)","DOI":"10.1109\/LICS.2006.38"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L., Tzevelekos: Functional reachability. In: Procs. LICS 2009, pp. 286\u2013295 (2009)","DOI":"10.1109\/LICS.2009.48"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Stirling, C.: Higher-order matching, games and automata. In: Procs. LICS 2007, pp. 326\u2013335 (2007)","DOI":"10.1109\/LICS.2007.23"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-00596-1_8","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Stirling","year":"2009","unstructured":"Stirling, C.: Dependency tree automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 92\u2013106. Springer, Heidelberg (2009)"},{"issue":"3:2","key":"1_CR7","first-page":"1","volume":"5","author":"C. Stirling","year":"2009","unstructured":"Stirling, C.: Decidability of higher-order matching. Logical Methods in Computer Science\u00a05(3:2), 1\u201352 (2009)","journal-title":"Logical Methods in Computer Science"}],"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-12032-9_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:46:57Z","timestamp":1606168017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}