Inference systems are a widespread framework used to define possibly recursive predicates
by means of inference rules. They allow both inductive and coinductive interpretations that …

Checked corecursive streams are a novel approach to stream definitions relying on a
semantics of function application detecting cyclic calls, and a well-definedness check …

It is well known that big-step semantics is not able to distinguish stuck and non-terminating
computations. This is a strong limitation as it makes it very difficult to reason about properties …

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 …

Recursive de nitions of predicates by means of inference rules are ubiquitous in computer
science. They are usually interpreted inductively or coinductively, however there are …

In recent work, non-periodic streams have been defined corecursively, by representing them
with finitary equational systems built on top of various operators, besides the standard …

In recent work, non-regular streams have been defined corecursively, by representing them
with finitary equational systems built on top of various operators, besides the standard …

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 …

Nowadays, data structures which are conceptually infinite, such as streams or infinite trees,
are very common in computer science. When it comes to their manipulation, one major …

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 …