{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:34Z","timestamp":1750306354255,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"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":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934506","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"337-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Program Equivalence is Coinductive"],"prefix":"10.1145","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[{"name":"The Australian National University"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37075-5_9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1044"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_6"},{"key":"e_1_3_2_1_4_1","first-page":"350","volume-title":"APLAS 2012","volume":"7705","author":"Brotherston J.","year":"2012","unstructured":"J. Brotherston , N. Gorogiannis , and R. Petersen . A generic cyclic theorem prover. In Programming Languages and Systems , APLAS 2012 , vol. 7705 of LNCS, pp. 350 -- 367 . Springer , 2012 . J. Brotherston, N. Gorogiannis, and R. Petersen. A generic cyclic theorem prover. In Programming Languages and Systems, APLAS 2012, vol. 7705 of LNCS, pp. 350--367. Springer, 2012."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exq052"},{"key":"e_1_3_2_1_6_1","series-title":"LIPIcs","first-page":"143","volume-title":"Rewriting Techniques and Applications, RTA","author":"Endrullis J.","year":"2015","unstructured":"J. Endrullis , H. Hansen , D. Hendriks , A. Polonsky , and A. Silva . A coinductive framework for infinitary rewriting and equational reasoning . In Rewriting Techniques and Applications, RTA 2015 , vol. 36 of LIPIcs , pp. 143 -- 159 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 2015. J. Endrullis, H. Hansen, D. Hendriks, A. Polonsky, and A. Silva. A coinductive framework for infinitary rewriting and equational reasoning. In Rewriting Techniques and Applications, RTA 2015, vol. 36 of LIPIcs, pp. 143--159. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2015."},{"key":"e_1_3_2_1_7_1","first-page":"265","volume-title":"IFIP TCS 2014","volume":"8705","author":"Goncharov S.","year":"2014","unstructured":"S. Goncharov , S. Milius , and A. Silva . Towards a coalgebraic Chomsky hierarchy. In Theoretical Computer Science , IFIP TCS 2014 , vol. 8705 of LNCS, pp. 265 -- 280 . Springer , 2014 . S. Goncharov, S. Milius, and A. Silva. Towards a coalgebraic Chomsky hierarchy. In Theoretical Computer Science, IFIP TCS 2014, vol. 8705 of LNCS, pp. 265--280. Springer, 2014."},{"key":"e_1_3_2_1_8_1","first-page":"18","volume-title":"CALCO 2009","volume":"5728","author":"Goncharov S.","year":"2009","unstructured":"S. Goncharov , L. Schr\u00f6der , and T. Mossakowski . Kleene monads: Handling iteration in a framework of generic effects. In Algebra and Coalgebra in Computer Science , CALCO 2009 , vol. 5728 of LNCS, pp. 18 -- 33 . Springer , 2009 . S. Goncharov, L. Schr\u00f6der, and T. Mossakowski. Kleene monads: Handling iteration in a framework of generic effects. In Algebra and Coalgebra in Computer Science, CALCO 2009, vol. 5728 of LNCS, pp. 18--33. Springer, 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196713500021"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2014.02.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256195"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"e_1_3_2_1_13_1","first-page":"10","article-title":"Linear usage of state","author":"M\u00f8gelberg R.","year":"2014","unstructured":"R. M\u00f8gelberg and S. Staton . Linear usage of state . Log. Meth. Comput. Sci. , 10 , 2014 . R. M\u00f8gelberg and S. Staton. Linear usage of state. Log. Meth. Comput. Sci., 10, 2014.","journal-title":"Log. Meth. Comput. Sci."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.12.019"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11548133_3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.10.018"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.04.018"},{"key":"e_1_3_2_1_18_1","first-page":"297","volume-title":"CMCS 2004","volume":"106","author":"Power J.","year":"2004","unstructured":"J. Power and O. Shkaravska . From comodels to coalgebras: State and arrays. In Coalgebraic Methods in Computer Science , CMCS 2004 , vol. 106 of ENTCS, pp. 297 -- 314 , 2004 . J. Power and O. Shkaravska. From comodels to coalgebras: State and arrays. In Coalgebraic Methods in Computer Science, CMCS 2004, vol. 106 of ENTCS, pp. 297--314, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788864"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:03Z","timestamp":1750222563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":20,"alternative-id":["10.1145\/2933575.2934506","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934506","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}