{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:00:42Z","timestamp":1725490842881},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735946"},{"type":"electronic","value":"9783540735953"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73595-3_1","type":"book-chapter","created":{"date-parts":[[2007,8,30]],"date-time":"2007-08-30T09:31:33Z","timestamp":1188466293000},"page":"1-2","source":"Crossref","is-referenced-by-count":0,"title":["Games, Automata and Matching"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Draft Book (2002), \n                    \n                      http:\/\/l3ux02.univ-lille3.fr\/tata\/"},{"key":"1_CR2","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_CR3","doi-asserted-by":"crossref","unstructured":"Dowek, G.: Higher-order unification and matching. In: Robinson, A., Voronkov, A. (ed.) Handbook of Automated Reasoning, vol. 2, pp. 1009\u20131062, North-Holland (2001)","DOI":"10.1016\/B978-044450813-3\/50018-7"},{"key":"1_CR4","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_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BFb0037110","volume-title":"Typed Lambda Calculi and Applications","author":"A. Jung","year":"1993","unstructured":"Jung, A., Tiuryn, J.: A new characterisation of lambda definability. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 245\u2013257. Springer, Heidelberg (1993)"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/jigpal\/11.1.51","volume":"11","author":"R. Loader","year":"2003","unstructured":"Loader, R.: Higher-order \u03b2-matching is undecidable. Logic Journal of the IGPL\u00a011(1), 51\u201368 (2003)","journal-title":"Logic Journal of the IGPL"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Procs LICS, pp. 81\u201390 (Longer version available from Ong\u2019s web page) (2006)","DOI":"10.1109\/LICS.2006.38"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500003108","volume":"10","author":"V. Padovani","year":"2001","unstructured":"Padovani, V.: Decidability of fourth-order matching. Mathematical Structures in Computer Science\u00a010(3), 361\u2013372 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR9","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":"1_CR10","volume-title":"Texts in Computer Science","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. In: Texts in Computer Science, Springer, Heidelberg (2001)"},{"key":"1_CR11","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":"1_CR12","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)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-21"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73595-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:52:59Z","timestamp":1619517179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73595-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735946","9783540735953"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73595-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}