乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:05:25Z","timestamp":1730318725760,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009854","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"246-259","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["On the relationship between higher-order recursion schemes and higher-order fixpoint logic"],"prefix":"10.1145","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[{"name":"University of Tokyo, Japan"}]},{"given":"\u00c9tienne","family":"Lozes","sequence":"additional","affiliation":[{"name":"ENS, France \/ CNRS, France"}]},{"given":"Florian","family":"Bruse","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3)","author":"Aehlig K.","year":"2007","unstructured":"K. Aehlig . A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3) , 2007 . K. Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007."},{"key":"e_1_3_2_1_2_1","volume-title":"The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science, 3(2)","author":"Axelsson R.","year":"2007","unstructured":"R. Axelsson , M. Lange , and R. Somla . The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science, 3(2) , 2007 . R. Axelsson, M. Lange, and R. Somla. The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science, 3(2), 2007."},{"key":"e_1_3_2_1_3_1","series-title":"LIPIcs","first-page":"148","volume-title":"Proceedings of CSL","author":"Broadbent C. H.","year":"2013","unstructured":"C. H. Broadbent and N. Kobayashi . Saturation-based model checking of higher-order recursion schemes . In Proceedings of CSL 2013 , volume 23 of LIPIcs , pages 129\u2013 148 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. C. H. Broadbent and N. Kobayashi. Saturation-based model checking of higher-order recursion schemes. In Proceedings of CSL 2013, volume 23 of LIPIcs, pages 129\u2013148. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013."},{"key":"e_1_3_2_1_4_1","volume-title":"Model Checking","author":"Clarke E. M.","year":"1999","unstructured":"E. M. Clarke , O. Grumberg , and D. A. Peled . Model Checking . The MIT Press , 1999 . E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/LICS.2008.34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1017\/S0956796800003889"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.5555\/646794.704852"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1480881.1480933"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1599410.1599415"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.5555\/1987171.1987193"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/2487241.2487246"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_3_2_1_13_1","volume-title":"Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Logical Methods in Computer Science, 7(4)","author":"Kobayashi N.","year":"2011","unstructured":"N. Kobayashi and C.-H. L. Ong . Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Logical Methods in Computer Science, 7(4) , 2011 . N. Kobayashi and C.-H. L. Ong. Complexity of model checking recursion schemes for fragments of the modal mu-calculus. Logical Methods in Computer Science, 7(4), 2011."},{"unstructured":"N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. A revised and extended version of {12}. http:\/\/www-kb.is.s.u-tokyo. ac.jp\/~koba\/papers\/lics09-full.pdf 2012. N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. A revised and extended version of {12}. http:\/\/www-kb.is.s.u-tokyo. ac.jp\/~koba\/papers\/lics09-full.pdf 2012.","key":"e_1_3_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1993498.1993525"},{"key":"e_1_3_2_1_16_1","volume-title":"On the relationship between higher-order recursion schemes and higher-order fixpoint logic","author":"Kobayashi N.","year":"2016","unstructured":"N. Kobayashi , \u00c9. Lozes, and F. Bruse . On the relationship between higher-order recursion schemes and higher-order fixpoint logic , 2016 . N. Kobayashi, \u00c9. Lozes, and F. Bruse. On the relationship between higher-order recursion schemes and higher-order fixpoint logic, 2016."},{"unstructured":"A longer version available from the first author\u2019s web page. A longer version available from the first author\u2019s web page.","key":"e_1_3_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-642-54833-8_21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/978-3-319-21668-3_17"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1016\/j.tcs.2014.08.020"},{"key":"e_1_3_2_1_21_1","first-page":"142","volume-title":"Proceedings of Tenth International Workshop on Fixed Points in Computer Science (FICS 2015","volume":"191","year":"2015","unstructured":"\u00c9. Lozes. A type-directed negation elimination. In R. Matthes and M. Mio, editors , Proceedings of Tenth International Workshop on Fixed Points in Computer Science (FICS 2015 ), volume 191 of EPTCS, pages 132\u2013 142 , 2015 . \u00c9. Lozes. A type-directed negation elimination. In R. Matthes and M. Mio, editors, Proceedings of Tenth International Workshop on Fixed Points in Computer Science (FICS 2015), volume 191 of EPTCS, pages 132\u2013142, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/1764891.1764958"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/2837614.2837667"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/2364527.2364578"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/LICS.2006.38"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1926385.1926453"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/2535838.2535873"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.5555\/2027223.2027239"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/978-3-662-46678-0_22"},{"key":"e_1_3_2_1_30_1","series-title":"LIPIcs","first-page":"243","volume-title":"Proceedings of CSL","author":"Salvati S.","year":"2015","unstructured":"S. Salvati and I. Walukiewicz . A model for behavioural properties of higher-order programs . In Proceedings of CSL 2015 , volume 41 of LIPIcs , pages 229\u2013 243 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. S. Salvati and I. Walukiewicz. A model for behavioural properties of higher-order programs. In Proceedings of CSL 2015, volume 41 of LIPIcs, pages 229\u2013243. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1016\/0304-3975(90)90110-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2603088.2603133"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/2429069.2429081"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1007\/978-3-540-28644-8_33"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1007\/978-3-662-44584-6_22"}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"POPL '17","name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France"},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:33:52Z","timestamp":1693866832000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":35,"alternative-id":["10.1145\/3009837.3009854","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009854","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009854","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}