2026-07-22T08:36:03Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13158 2024-03-06T10:49:52Z ddc:004 open_access

Sound Regular Corecursion in coFJ Ancona, Davide Barbieri, Pietro Dagnino, Francesco Zucca, Elena Operational semantics coinduction programming paradigms regular terms The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite and methods are equipped with a codefinition (an alternative body). We provide an abstract semantics of the calculus based on the framework of inference systems with corules. In coFJ with this semantics, FJ recursive methods on finite objects can be extended to infinite objects as well, and behave as desired by the programmer, by specifying a codefinition. We also describe an operational semantics which can be directly implemented in a programming language, and prove the soundness of such semantics with respect to the abstract one. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Davide Ancona and Pietro Barbieri and Francesco Dagnino and Elena Zucca 2020 Is Part Of LIPIcs, Volume 166, 34th European Conference on Object-Oriented Programming (ECOOP 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECOOP.2020.1 urn:nbn:de:0030-drops-131582 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2020.1 eng https://creativecommons.org/licenses/by/3.0/legalcode