{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:41:37Z","timestamp":1742978497981,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220111"},{"type":"electronic","value":"9783642220128"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_12","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T07:29:39Z","timestamp":1308382179000},"page":"162-173","source":"Crossref","is-referenced-by-count":17,"title":["Krivine Machines and Higher-Order Schemes"],"prefix":"10.1007","author":[{"given":"S.","family":"Salvati","sequence":"first","affiliation":[]},{"given":"I.","family":"Walukiewicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-540-31982-5_31","volume-title":"Foundations of Software Science and Computational Structures","author":"K. Aehlig","year":"2005","unstructured":"Aehlig, K., de Miranda, J.G., Ong, C.-H.L.: Safety is not a restriction at level 2 for string languages. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 490\u2013504. Springer, Heidelberg (2005)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Broadbent, C., Carayol, A., Ong, L., Serre, O.: Recursion schemes and logical reflection. In: LICS, pp. 120\u2013129 (2010)","DOI":"10.1109\/LICS.2010.40"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-00596-1_9","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Broadbent","year":"2009","unstructured":"Broadbent, C., Ong, C.-H.L.: On global model checking trees generated by higher-order recursion schemes. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 107\u2013121. Springer, Heidelberg (2009)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Carayol, A., Hague, M., Meyer, A., Ong, L., Serre, O.: Winning regions of higher-order pushdown games. In: LICS, Pittsburgh, United States, pp. 193\u2013204 (2008)","DOI":"10.1109\/LICS.2008.41"},{"key":"12_CR5","volume-title":"Combinatory Logic","author":"H.B. Curry","year":"1958","unstructured":"Curry, H.B., Feys, R.: Combinatory Logic, vol.\u00a01. North-Holland Publishing Co., Amsterdam (1958)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"Damm, W.: The IO- and OI-hierarchies. Theoretical Computer Science\u00a020, 95\u2013207 (1982)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","unstructured":"Damm, W., Fehr, E.: A schematalogical approach to the alalysis of the procedure concept in Algol-languages. In: CLAAP, vol.\u00a01, pp. 130\u2013134. Universit\u00e9 de Lille (1980)"},{"key":"12_CR8","unstructured":"de Miranda, J.: Structures generated by Higher-Order Grammars and the Safety Constraint. PhD thesis, Oxford University (2006)"},{"key":"12_CR9","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":"12_CR10","unstructured":"Huet, G.: R\u00e9solution d\u2019\u00e9quations dans des langages d\u2019ordre 1,2,.,\u03c9. Th\u00e8se de doctorat en sciences math\u00e9matiques, Universit\u00e9 Paris VII (1976)"},{"key":"12_CR11","unstructured":"Kartzow, A.: Collapsible pushdown graphs of level 2 are tree-automatic. In: STACS. LIPIcs, vol.\u00a05, pp. 501\u2013512 (2010)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45931-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"T. Knapik","year":"2002","unstructured":"Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 205\u2013222. Springer, Heidelberg (2002)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1007\/11523468_117","volume-title":"Automata, Languages and Programming","author":"T. Knapik","year":"2005","unstructured":"Knapik, T., Niwinski, D., Urzycyzn, P., Walukiewicz, I.: Unsafe grammars and pannic automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1450\u20131461. Springer, Heidelberg (2005)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Ong, L.: A type system equivalent to modal mu-calculus model checking of recursion schemes. In: LICS, pp. 179\u2013188 (2009)","DOI":"10.1109\/LICS.2009.29"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10990-007-9018-9","volume":"20","author":"J.-L. Krivine","year":"2007","unstructured":"Krivine, J.-L.: A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation\u00a020(3), 199\u2013207 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Luke Ong, C.-H.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81\u201390 (2006)","DOI":"10.1109\/LICS.2006.38"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci.\u00a05(3), 223\u2013255 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Salvati, S., Walukiewicz, I.: Krivine machines and higher-order schemes (2011), http:\/\/www.labri.fr\/perso\/salvati\/downloads\/articles\/hpda-dec.pdf","DOI":"10.1007\/978-3-642-22012-8_12"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model checking. Information and Computation\u00a0164(2), 234\u2013263 (2001)","journal-title":"Information and Computation"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10990-007-9019-8","volume":"20","author":"M. Wand","year":"2007","unstructured":"Wand, M.: On the correctness of the Krivine machine. Higher-Order and Symbolic Computation\u00a020, 231\u2013235 (2007), 10.1007\/s10990-007-9019-8","journal-title":"Higher-Order and Symbolic Computation"}],"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-22012-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T09:46:54Z","timestamp":1741254414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}