{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:01Z","timestamp":1750220521168,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T00:00:00Z","timestamp":1595462400000},"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":[[2020,7,23]]},"DOI":"10.1145\/3427761.3428342","type":"proceedings-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T02:48:04Z","timestamp":1606272484000},"page":"4-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An inductive abstract semantics for coFJ"],"prefix":"10.1145","author":[{"given":"Pietro","family":"Barbieri","sequence":"first","affiliation":[{"name":"University of Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Dagnino","sequence":"additional","affiliation":[{"name":"University of Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Zucca","sequence":"additional","affiliation":[{"name":"University of Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"First Workshop on Coalgebra, Horn Clause Logic Programming and Types, CoALP-Ty' 16, volume 258 of Electronic Proceedings in Theoretical Computer Science","author":"Ancona Davide","year":"2017","unstructured":"Davide Ancona , Francesco Dagnino , and Elena Zucca . Extending coinductive logic programming with co-facts. In Ekaterina Komendantskaya and John Power, editors , First Workshop on Coalgebra, Horn Clause Logic Programming and Types, CoALP-Ty' 16, volume 258 of Electronic Proceedings in Theoretical Computer Science , pages 1 - 18 . Open Publishing Association , 2017 . doi: 10.4204\/EPTCS.258.1. 10.4204\/EPTCS.258.1 Davide Ancona, Francesco Dagnino, and Elena Zucca. Extending coinductive logic programming with co-facts. In Ekaterina Komendantskaya and John Power, editors, First Workshop on Coalgebra, Horn Clause Logic Programming and Types, CoALP-Ty' 16, volume 258 of Electronic Proceedings in Theoretical Computer Science, pages 1-18. Open Publishing Association, 2017. doi: 10.4204\/EPTCS.258.1."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Davide\n      Ancona Francesco\n      Dagnino and \n      Elena\n      Zucca\n    .\n  Generalizing inference systems by coaxioms\n  . In Hongseok Yang editor 26th European Symposium on Programming ESOP \n  2017 volume \n  10201\n   of \n  Lecture Notes in Computer Science pages \n  29\n  -\n  55\n  . \n  Springer 2017. doi: 10.1007\/978-3-662-54434-1_2.    10.1007\/978-3-662-54434-1_2\nDavide Ancona Francesco Dagnino and Elena Zucca. Generalizing inference systems by coaxioms. In Hongseok Yang editor 26th European Symposium on Programming ESOP 2017 volume 10201 of Lecture Notes in Computer Science pages 29-55. Springer 2017. doi: 10.1007\/978-3-662-54434-1_2.","DOI":"10.1007\/978-3-662-54434-1_2"},{"key":"e_1_3_2_1_3_1","volume-title":"ECOOP' 20-Object-Oriented Programming","author":"Ancona Davide","year":"2020","unstructured":"Davide Ancona , Pietro Barbieri , Francesco Dagnino , and Elena Zucca . Sound regular corecursion in coFJ . In ECOOP' 20-Object-Oriented Programming , 2020 . URL htp:\/\/arxiv.org\/abs\/ 2005.14085. To appear. Davide Ancona, Pietro Barbieri, Francesco Dagnino, and Elena Zucca. Sound regular corecursion in coFJ. In ECOOP' 20-Object-Oriented Programming, 2020. URL htp:\/\/arxiv.org\/abs\/ 2005.14085. To appear."},{"key":"e_1_3_2_1_4_1","volume-title":"Coaxioms: flexible coinductive definitions by inference systems. Logical Methods in Computer Science, 15 ( 1 )","author":"Dagnino Francesco","year":"2019","unstructured":"Francesco Dagnino . Coaxioms: flexible coinductive definitions by inference systems. Logical Methods in Computer Science, 15 ( 1 ) , 2019 . doi: 10.23638\/LMCS-15 ( 1 :26) 2019. 10.23638\/LMCS-15 Francesco Dagnino. Coaxioms: flexible coinductive definitions by inference systems. Logical Methods in Computer Science, 15 ( 1 ), 2019. doi: 10.23638\/LMCS-15 ( 1 :26) 2019."},{"key":"e_1_3_2_1_5_1","volume-title":"DIBRIS","author":"Dagnino Francesco","year":"2020","unstructured":"Francesco Dagnino . Foundations of regular coinduction. Technical report , DIBRIS , University of Genova , May 2020 . Available at htps: \/\/arxiv.org\/abs\/ 2006.02887. Submitted for journal publication. Francesco Dagnino. Foundations of regular coinduction. Technical report, DIBRIS, University of Genova, May 2020. Available at htps: \/\/arxiv.org\/abs\/ 2006.02887. Submitted for journal publication."},{"key":"e_1_3_2_1_6_1","first-page":"132","volume-title":"ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1999","author":"Igarashi Atsushi","year":"1999","unstructured":"Atsushi Igarashi , Benjamin C. Pierce , and Philip Wadler . Featherweight Java : A minimal core calculus for Java and GJ . In ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1999 , pages 132 - 146 . ACM Press , 1999 . doi: 10.1145\/320384.320395. 10.1145\/320384.320395 Atsushi Igarashi, Benjamin C. Pierce, and Philip Wadler. Featherweight Java: A minimal core calculus for Java and GJ. In ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1999, pages 132-146. ACM Press, 1999. doi: 10.1145\/320384.320395."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2017-1473"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Ekaterina\n      Komendantskaya Patricia\n      Johann and \n      Martin\n      Schmidt\n    .\n  A productivity checker for logic programming\n  . In Manuel V. Hermenegildo and Pedro L\u00f3pez-Garc\u00eda editors Logic-Based Program Synthesis and Transformation (LOPSTR \n  2016\n   ) Revised Selected Papers volume \n  10184\n   of \n  Lecture Notes in Computer Science pages \n  168\n  -\n  186\n  . \n  Springer 2016. doi: 10.1007\/978-3-319-63139-4\\_10.    10.1007\/978-3-319-63139-4\nEkaterina Komendantskaya Patricia Johann and Martin Schmidt. A productivity checker for logic programming. In Manuel V. Hermenegildo and Pedro L\u00f3pez-Garc\u00eda editors Logic-Based Program Synthesis and Transformation (LOPSTR 2016 ) Revised Selected Papers volume 10184 of Lecture Notes in Computer Science pages 168-186. Springer 2016. doi: 10.1007\/978-3-319-63139-4\\_10.","DOI":"10.1007\/978-3-319-63139-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu026"},{"key":"e_1_3_2_1_10_1","unstructured":"L. Simon. Extending logic programming with coinduction. PhD thesis University of Texas at Dallas 2006.  L. Simon. Extending logic programming with coinduction. PhD thesis University of Texas at Dallas 2006."}],"event":{"name":"SPLASH '20: Conference on Systems, Programming, Languages, and Applications, Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual USA","acronym":"SPLASH '20"},"container-title":["Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427761.3428342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427761.3428342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:40Z","timestamp":1750195480000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427761.3428342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,23]]},"references-count":10,"alternative-id":["10.1145\/3427761.3428342","10.1145\/3427761"],"URL":"https:\/\/doi.org\/10.1145\/3427761.3428342","relation":{},"subject":[],"published":{"date-parts":[[2020,7,23]]},"assertion":[{"value":"2020-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}