Distributed collective systems are systems formed by homogeneous dynamic collections of
devices acting in a shared environment to pursue a joint task or goal. Typical applications …

We extend the semantics and type system of a lambda calculus equipped with common
constructs to be resource-aware. That is, reduction is instrumented to keep track of the …

A binary session is a private communication channel that connects two processes, each
adhering to a protocol description called session type. In this work, we study the first type …

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 …

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 …

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 …

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 …

There exists a broad family of multiparty sessions in which the progress of one session
participant is not unconditional, but depends on the choices performed by other participants …

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 describe …