{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:28Z","timestamp":1725566728308},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_10","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"119-134","source":"Crossref","is-referenced-by-count":5,"title":["Higher-Order Matching and Games"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_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":"10_CR2","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1016\/B978-044450813-3\/50018-7","volume-title":"Handbook of Automated Reasoning","author":"G. Dowek","year":"2001","unstructured":"Dowek, G.: Higher-order unification and matching. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a02, pp. 1009\u20131062. North-Holland, Amsterdam (2001)"},{"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":"10_CR3"},{"issue":"1","key":"10_CR4","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":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-61780-9_71","volume-title":"Types for Proofs and Programs","author":"V. Padovani","year":"1996","unstructured":"Padovani, V.: Decidability of all minimal models. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol.\u00a01158, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"issue":"3","key":"10_CR6","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":"10_CR7","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":"10_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-540-45085-6_41","volume-title":"Automated Deduction \u2013 CADE-19","author":"M. Schmidt-Schau\u03b2","year":"2003","unstructured":"Schmidt-Schau\u03b2, M.: Decidability of arity-bounded higher-order matching. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 488\u2013502. Springer, Heidelberg (2003)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: The typed \u03bb-calculus is not elementary recursive. Theoretical Computer Science\u00a09, 73\u201381 (1979)","journal-title":"Theoretical Computer Science"},{"key":"10_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)"},{"key":"10_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-48660-7_6","volume-title":"Automated Deduction - CADE-16","author":"T. Wierzbicki","year":"1999","unstructured":"Wierzbicki, T.: Complexity of higher-order matching. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 82\u201396. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:11Z","timestamp":1619506451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11538363_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}