{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:13:39Z","timestamp":1743653619674,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_31","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"325-336","source":"Crossref","is-referenced-by-count":9,"title":["Two-Level Game Semantics, Intersection Types, and Recursion Schemes"],"prefix":"10.1007","author":[{"given":"C. -H. Luke","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tsukada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Ong, C.H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81\u201390. IEEE Computer Society (2006)","DOI":"10.1109\/LICS.2006.38"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput.\u00a0163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 416\u2013428. ACM (2009)","DOI":"10.1145\/1594834.1480933"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10849-009-9110-0","volume":"19","author":"S. Salvati","year":"2010","unstructured":"Salvati, S.: On the membership problem for non-linear abstract categorial grammars. Journal of Logic, Language and Information\u00a019(2), 163\u2013183 (2010)","journal-title":"Journal of Logic, Language and Information"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Ong, C.H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: LICS, pp. 179\u2013188. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.29"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Hague, M., Murawski, A.S., Ong, C.H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: LICS, pp. 452\u2013461 (2008)","DOI":"10.1109\/LICS.2008.34"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-22012-8_12","volume-title":"Automata, Languages and Programming","author":"S. Salvati","year":"2011","unstructured":"Salvati, S., Walukiewicz, I.: Krivine Machines and Higher-Order Schemes. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 162\u2013173. Springer, Heidelberg (2011)"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","volume":"69","author":"F. Nielson","year":"1989","unstructured":"Nielson, F.: Two-level semantics and abstract interpretation. Theor. Comput. Sci.\u00a069(2), 117\u2013242 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-19805-2_18","volume-title":"Foundations of Software Science and Computational Structures","author":"N. Kobayashi","year":"2011","unstructured":"Kobayashi, N.: A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 260\u2013274. Springer, Heidelberg (2011)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-12032-9_24","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Tsukada","year":"2010","unstructured":"Tsukada, T., Kobayashi, N.: Untyped Recursion Schemes and Infinite Intersection Types. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 343\u2013357. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T13:49:29Z","timestamp":1743601769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}