A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Sound Regular Corecursion in coFJ
2020
European Conference on Object-Oriented Programming
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
doi:10.4230/lipics.ecoop.2020.1
dblp:conf/ecoop/AnconaBDZ19
fatcat:g3wzfqyp2rfgfakt5tbuxle5gi