{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:15Z","timestamp":1742913735584,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030994600"},{"type":"electronic","value":"9783030994617"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-99461-7_1","type":"book-chapter","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T23:02:40Z","timestamp":1651532560000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Expressivity of\u00a0Checked Corecursive Streams"],"prefix":"10.1007","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro","family":"Barbieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Zucca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"issue":"4","key":"1_CR1","first-page":"142","volume":"39","author":"D Ancona","year":"2013","unstructured":"Ancona, D.: Regular corecursion in Prolog. Comput. Lang. Syst. Struct. 39(4), 142\u2013162 (2013)","journal-title":"Comput. Lang. Syst. Struct."},{"key":"1_CR2","unstructured":"Ancona, D., Barbieri, P., Dagnino, F., Zucca, E.: Sound regular corecursion in coFJ. In: Hirschfeld, R., Pape, T. (eds.) ECOOP\u201920 - Object-Oriented Programming. LIPIcs, vol. 166, pp. 1:1\u20131:28. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"1_CR3","unstructured":"Ancona, D., Barbieri, P., Zucca, E.: Enhanced regular corecursion for data streams. In: ICTCS\u201921 - Italian Conference on Theoretical Computer Science (2021)"},{"key":"1_CR4","unstructured":"Ancona, D., Barbieri, P., Zucca, E.: Enhancing expressivity of checked corecursive streams (extended version) (2022). https:\/\/arxiv.org\/abs\/2202.06868"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-662-54434-1_2","volume-title":"Programming Languages and Systems","author":"D Ancona","year":"2017","unstructured":"Ancona, D., Dagnino, F., Zucca, E.: Generalizing inference systems by coaxioms. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 29\u201355. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_2"},{"issue":"3\u20134","key":"1_CR6","first-page":"221","volume":"140","author":"D Ancona","year":"2015","unstructured":"Ancona, D., Dovier, A.: A theoretical perspective of coinductive logic programming. Fund. Inform. 140(3\u20134), 221\u2013246 (2015)","journal-title":"Fund. Inform."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Ancona, D., Zucca, E.: Corecursive featherweight Java. In: FTfJP\u201912 - Formal Techniques for Java-like Programs, pp. 3\u201310. ACM Press (2012)","DOI":"10.1145\/2318202.2318205"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoret. Comput. Sci. 25, 95\u2013169 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR9","unstructured":"Czajka, L.: A new coinductive confluence proof for infinitary lambda calculus. Log. Methods Comput. Sci. 16(1) (2020)"},{"key":"1_CR10","unstructured":"Dagnino, F.: Flexible coinduction. Ph.D. thesis, DIBRIS, University of Genova (2021)"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1017\/S147106842000023X","volume":"20","author":"F Dagnino","year":"2020","unstructured":"Dagnino, F., Ancona, D., Zucca, E.: Flexible coinductive logic programming. Theory Pract. Logic Program. 20(6), 818\u2013833 (2020). Issue for ICLP 2020","journal-title":"Theory Pract. Logic Program."},{"issue":"5\u20136","key":"1_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S0956796810000213","volume":"20","author":"R Hinze","year":"2010","unstructured":"Hinze, R.: Concrete stream calculus: an extended study. J. Funct. Program. 20(5\u20136), 463\u2013535 (2010)","journal-title":"J. Funct. Program."},{"issue":"2\u20134","key":"1_CR13","first-page":"185","volume":"17","author":"J-B Jeannin","year":"2012","unstructured":"Jeannin, J.-B., Kozen, D.: Computing with capsules. J. Autom. Lang. Comb. 17(2\u20134), 185\u2013204 (2012)","journal-title":"J. Autom. Lang. Comb."},{"key":"1_CR14","first-page":"347","volume":"150","author":"J-B Jeannin","year":"2017","unstructured":"Jeannin, J.-B., Kozen, D., Silva, A.: CoCaml: functional programming with regular coinductive types. Fund. Inform. 150, 347\u2013377 (2017)","journal-title":"Fund. Inform."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-319-63139-4_10","volume-title":"Logic-Based Program Synthesis and Transformation","author":"E Komendantskaya","year":"2017","unstructured":"Komendantskaya, E., Johann, P., Schmidt, M.: A productivity checker for logic programming. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 168\u2013186. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63139-4_10"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1093\/logcom\/exu026","volume":"26","author":"E Komendantskaya","year":"2016","unstructured":"Komendantskaya, E., Power, J., Schmidt, M.: Coalgebraic logic programming: from semantics to implementation. J. Log. Comput. 26(2), 745\u2013783 (2016)","journal-title":"J. Log. Comput."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1017\/S0960129504004517","volume":"15","author":"JJMM Rutten","year":"2005","unstructured":"Rutten, J.J.M.M.: A coinductive calculus of streams. Math. Struct. Comput. Sci. 15(1), 93\u2013147 (2005)","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR18","unstructured":"Simon, L.: Extending logic programming with coinduction. Ph.D. thesis, University of Texas at Dallas (2006)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-73420-8_42","volume-title":"Automata, Languages and Programming","author":"L Simon","year":"2007","unstructured":"Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-logic programming: extending logic programming with coinduction. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 472\u2013483. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_42"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99461-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T23:02:50Z","timestamp":1651532570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99461-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030994600","9783030994617"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99461-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FLOPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Functional and Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"flops2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/flops-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}