1.2k citations · 3.5k across the 39 of their papers we have counts for
10 papers · 1 filter
Coeffects for Sharing and Mutation
Riccardo Bianchini, Francesco Dagnino, Paola Giannini +2
In type-and-coeffect systems, contexts are enriched by coeffects modeling how they are actually used, typically through annotations on single variables. Coeffects are computed bott…
Enhancing expressivity of checked corecursive streams (extended version)
Davide Ancona, Pietro Barbieri, Elena Zucca
We propose a novel approach to stream definition and manipulation. Our solution is based on two key ideas. Regular corecursion, which avoids non termination by detecting cyclic cal…
Enhanced Regular Corecursion for Data Streams
Davide Ancona, Pietro Barbieri, Elena Zucca
We propose a simple calculus for processing data streams (infinite flows of data series), represented by finite sets of equations built on stream operators. Furthermore, functions…
Flexible coinductive logic programming
Francesco Dagnino, Davide Ancona, Elena Zucca
Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction,…
Sound Regular Corecursion in coFJ
Davide Ancona, Pietro Barbieri, Francesco Dagnino +1
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 describ…
Soundness conditions for big-step semantics
Francesco Dagnino, Viviana Bono, Elena Zucca +1
We propose a general proof technique to show that a predicate is sound, that is, prevents stuck computation, with respect to a big-step semantics. This result may look surprising,…