7 citations · 17 across the 8 of their papers we have counts for
7 papers · 1 filter
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…
Towards Runtime Monitoring of Node.js and Its Application to the Internet of Things
Davide Ancona, Luca Franceschini, Giorgio Delzanno +3
In the last years Node.js has emerged as a framework particularly suitable for implementing lightweight IoT applications, thanks to its underlying asynchronous event-driven, non bl…
Structural Resolution for Abstract Compilation of Object-Oriented Languages
Luca Franceschini, Davide Ancona, Ekaterina Komendantskaya
We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program,…