7 citations · 14 across the 3 of their papers we have counts for
5 papers
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…
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,…
Extending Coinductive Logic Programming with Co-Facts
Davide Ancona, Francesco Dagnino, Elena Zucca
We introduce a generalized logic programming paradigm where programs, consisting of facts and rules with the usual syntax, can be enriched by co-facts, which syntactically resemble…