DeepAI AI Chat
Log In Sign Up

Sound Regular Corecursion in coFJ

by   Davide Ancona, et al.

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.


page 6

page 7

page 17

page 18

page 19


Abductive functional programming, a semantic approach

We propose a call-by-value lambda calculus extended with a new construct...

A Fibrational Tale of Operational Logical Relations: Pure, Effectful and Differential

Logical relations built on top of an operational semantics are one of th...

Probabilistic Programming Semantics for Name Generation

We make a formal analogy between random sampling and fresh name generati...

Automating Abstract Interpretation of Abstract Machines

Static program analysis is a valuable tool for any programming language ...

Introducing Yet Another REversible Language

Yarel is a core reversible programming language that implements a class ...

Formalisation of a frame stack semantics for a Java-like language

We present a Coq formalisation of the small-step operational semantics o...

On the Design, Implementation, and Use of Laziness in R

The R programming language has been lazy for over twenty-five years. Thi...