{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T21:22:37Z","timestamp":1784150557865,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429093","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"193-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["The power of parameterization in coinductive proof"],"prefix":"10.1145","author":[{"given":"Chung-Kil","family":"Hur","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Neis","sequence":"additional","affiliation":[{"name":"MPI-SWS & Saarland University, Saarbruecken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Derek","family":"Dreyer","sequence":"additional","affiliation":[{"name":"MPI-SWS, Saarbruecken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viktor","family":"Vafeiadis","sequence":"additional","affiliation":[{"name":"MPI-SWS, Kaiserslautern, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316076"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004122"},{"key":"e_1_3_2_2_3_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-60579-7_3","volume-title":"Types for Proofs and Programs","author":"Gim\u00e9nez E.","year":"1995","unstructured":"E. Gim\u00e9nez . Codifying guarded definitions with recursive schemes . In Types for Proofs and Programs , volume 996 of LNCS , pages 39 -- 59 . Springer , 1995 . E. Gim\u00e9nez. Codifying guarded definitions with recursive schemes. In Types for Proofs and Programs, volume 996 of LNCS, pages 39--59. Springer, 1995."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00353-3"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31984-9_26"},{"key":"e_1_3_2_2_6_1","volume-title":"Heq: a Coq library for heterogeneous equality","author":"Hur C.-K.","year":"2010","unstructured":"C.-K. Hur . Heq: a Coq library for heterogeneous equality , 2010 . Presented at Coq- 2 workshop. C.-K. Hur. Heq: a Coq library for heterogeneous equality, 2010. Presented at Coq-2 workshop."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103666"},{"key":"e_1_3_2_2_8_1","first-page":"321","volume-title":"IFIP Congress","author":"Jones C. B.","year":"1983","unstructured":"C. B. Jones . Specification and design of (parallel) programs . In IFIP Congress , pages 321 -- 332 , 1983 . C. B. Jones. Specification and design of (parallel) programs. In IFIP Congress, pages 321--332, 1983."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"e_1_3_2_2_10_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BFb0026106","volume-title":"CAAP","author":"Larsen K. G.","year":"1988","unstructured":"K. G. Larsen . Proof systems for Hennessy-Milner logic with recursion . In CAAP , volume 299 of LNCS , pages 215 -- 230 . Springer , 1988 . K. G. Larsen. Proof systems for Hennessy-Milner logic with recursion. In CAAP, volume 299 of LNCS, pages 215--230. Springer, 1988."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_47"},{"key":"e_1_3_2_2_12_1","first-page":"172","article-title":"Inductive types and type constraints in the second-order lambda calculus","author":"Mendler N. P.","year":"1991","unstructured":"N. P. Mendler . Inductive types and type constraints in the second-order lambda calculus . Annals of Pure and Applied Logic, 51(1--2):159 -- 172 , 1991 . N. P. Mendler. Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic, 51(1--2):159 -- 172, 1991.","journal-title":"Annals of Pure and Applied Logic, 51(1--2):159 --"},{"key":"e_1_3_2_2_13_1","volume-title":"Communicating and Mobile Systems: The Pi-Calculus","author":"Milner R.","year":"1999","unstructured":"R. Milner . Communicating and Mobile Systems: The Pi-Calculus . Cambridge University Press , 1999 . R. Milner. Communicating and Mobile Systems: The Pi-Calculus. Cambridge University Press, 1999."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00126-2"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268134"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12032-9_9"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129598002527"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2103603"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2103601"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926393"},{"key":"e_1_3_2_2_21_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-50939-9_144","volume-title":"TAPSOFT","author":"Stirling C.","year":"1989","unstructured":"C. Stirling and D. Walker . Local model checking in the modal mu-calculus . In TAPSOFT , Vol. 1 (CAAP), volume 351 of LNCS , pages 369 -- 383 . Springer , 1989 . C. Stirling and D. Walker. Local model checking in the modal mu-calculus. In TAPSOFT, Vol.1 (CAAP), volume 351 of LNCS, pages 369--383. Springer, 1989."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"e_1_3_2_2_23_1","series-title":"LNCS","first-page":"761","volume-title":"ICALP","author":"Winskel G.","year":"1989","unstructured":"G. Winskel . A note on model checking the modal \u03bd-calculus . In ICALP , volume 372 of LNCS , pages 761 -- 772 . Springer , 1989 . G. Winskel. A note on model checking the modal \u03bd-calculus. In ICALP, volume 372 of LNCS, pages 761--772. Springer, 1989."}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":23,"alternative-id":["10.1145\/2429069.2429093","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429093","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429093","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}