This report documents the program and the outcomes of Dagstuhl Seminar 19391``Data
Ecosystems: Sovereign Data Exchange among Organizations''. The goal of the seminar was …

We solve the inhabitation problem for a language called λ!, a subsuming paradigm (inspired
by call-by-push-value) being able to encode, among others, call-by-name and call-by-value …

Motion Planning is widely acknowledged as a fundamental problem of robotics. Due to the
continuous efforts of the scientific community, various algorithmic families emerged that have …

Intersection types have come a long way since their introduction in the Seventies. They have
been exploited for characterising behaviours of λ-terms and π-calculus processes, building λ …

We present FJ& λ, a new core calculus that extends Featherweight Java (FJ) with interfaces,
supporting multiple inheritance in a restricted form, λ-expressions, and intersection types …

We report on a type-theoretic method for functional synthesis of processes from repositories
of components. Our method relies on the existing framework for composition synthesis …

The inhabitation problem for intersection types in the lambda-calculus is known to be
undecidable. We study the problem in the case of non-idempotent intersection, considering …

A language-agnostic approach for type-based component-oriented software synthesis is
developed from the fundamental principles of abstract algebra and Combinatory Logic. It …

This paper studies the notion of meaningfulness for a unifying framework called dBang-
calculus, which subsumes both call-by-name (dCbN) and call-by-value (dCbV). We first …

We introduce an approach that aims to combine the usage of satisfiability modulo theories
(SMT) solvers with the Combinatory Logic Synthesizer (CL) S framework.(CL) S is a tool for …