Multiparty sessions with asynchronous communications and global types play an important
role for the modelling of interaction protocols in distributed systems. In designing such …

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 …

Recursive definitions of predicates are usually interpreted either inductively or coinductively.
Recently, a more powerful approach has been proposed, called flexible coinduction, to …

Theorem provers are tools that help users to write machine readable proofs. Some of this
tools are also interactive. The need of such softwares is increasing since they provide proofs …

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 …

Sessions are a fundamental notion in message-passing systems. A session is an abstract
notion of communication between parties where each one owns an endpoint. Session types …

In sequential functional languages, sized types enable termination checking of programs
with complex patterns of recursion in the presence of mixed inductive-coinductive types. In …

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 …