{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T18:33:38Z","timestamp":1723055618725},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500591","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T13:13:17Z","timestamp":1380114797000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Wellfounded recursion with copatterns"],"prefix":"10.1145","author":[{"given":"Andreas M.","family":"Abel","sequence":"first","affiliation":[{"name":"Ludwig-Maximilians-University, Munich, Germany"}]},{"given":"Brigitte","family":"Pientka","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129508006853"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.77.1"},{"key":"e_1_3_2_1_4_1","volume-title":"Wellfounded recursion with copatterns: A unified approach to termination and productivity. URL http:\/\/www.tcs.ifi.lmu.de\/ abel\/icfp13-long.pdf. Extended version","author":"Abel A.","year":"2013","unstructured":"A. Abel and B. Pientka . Wellfounded recursion with copatterns: A unified approach to termination and productivity. URL http:\/\/www.tcs.ifi.lmu.de\/ abel\/icfp13-long.pdf. Extended version , 2013 . A. Abel and B. Pientka. Wellfounded recursion with copatterns: A unified approach to termination and productivity. URL http:\/\/www.tcs.ifi.lmu.de\/ abel\/icfp13-long.pdf. Extended version, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429075"},{"key":"e_1_3_2_1_6_1","volume-title":"Workshop on Partiality and Recursion in Interactive Theorem Provers, FLoC 2010","author":"Altenkirch T.","year":"2010","unstructured":"T. Altenkirch and N. A. Danielsson . Termination checking in the presence of nested inductive and coinductive types. Short note supporting a talk given at PAR 2010 , Workshop on Partiality and Recursion in Interactive Theorem Provers, FLoC 2010 , 2010 . URL http:\/\/www.cse.chalmers.se\/ nad\/publications\/altenkirch-danielsson-par2%010.pdf. T. Altenkirch and N. A. Danielsson. Termination checking in the presence of nested inductive and coinductive types. Short note supporting a talk given at PAR 2010, Workshop on Partiality and Recursion in Interactive Theorem Provers, FLoC 2010, 2010. URL http:\/\/www.cse.chalmers.se\/ nad\/publications\/altenkirch-danielsson-par2%010.pdf."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646790.704524"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004122"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_35"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11916277_8"},{"key":"e_1_3_2_1_12_1","volume-title":"Comput. Sci., 5 (3)","author":"Ghani N.","year":"2009","unstructured":"N. Ghani , P. Hancock , and D. Pattinson . Representations of stream processors using nested fixed points. Logical Meth . in Comput. Sci., 5 (3) , 2009 . N. Ghani, P. Hancock, and D. Pattinson. Representations of stream processors using nested fixed points. Logical Meth. in Comput. Sci., 5 (3), 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/64805"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.240882"},{"key":"e_1_3_2_1_16_1","volume-title":"The Coq Proof Assistant Reference Manual. INRIA, version 8.4 edition","author":"INRIA.","year":"2012","unstructured":"INRIA. The Coq Proof Assistant Reference Manual. INRIA, version 8.4 edition , 2012 . URL http:\/\/coq.inria.fr\/. INRIA. The Coq Proof Assistant Reference Manual. INRIA, version 8.4 edition, 2012. URL http:\/\/coq.inria.fr\/."},{"key":"e_1_3_2_1_18_1","volume-title":"New Orleans","author":"Sacchini J. L.","year":"2013","unstructured":"J. L. Sacchini . Type-based productivity of stream definitions in the calculus of constructions. In Logics in Computer Science (LICS 2013), June 25--28, 2013 , New Orleans , 2013 . J. L. Sacchini. Type-based productivity of stream definitions in the calculus of constructions. In Logics in Computer Science (LICS 2013), June 25--28, 2013, New Orleans, 2013."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/69558.69563"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754809.1754838"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275781"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964006"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019916231463"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:06:46Z","timestamp":1693854406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500591"}},"subtitle":["a unified approach to termination and productivity"],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":21,"alternative-id":["10.1145\/2500365.2500591","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500591","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500591","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}