Search

• < Previous
• 1
• Next >

---

On Global Types and Multi-Party Session

Giuseppe Castagna ; Mariangiola Dezani-Ciancaglini ; Luca Padovani.

Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessions&nbsp;[&hellip;]

---

Java & Lambda: a Featherweight Story

Lorenzo Bettini ; Viviana Bono ; Mariangiola Dezani-Ciancaglini ; Paola Giannini ; Betti Venneri.

We present FJ&$\lambda$, a new core calculus that extends Featherweight Java (FJ) with interfaces, supporting multiple inheritance in a restricted form, $\lambda$-expressions, and intersection types. Our main goal is to formalise how lambdas and intersection types are grafted on Java 8, by studying&nbsp;[&hellip;]

---

On Sessions and Infinite Data

Paula Severi ; Luca Padovani ; Emilio Tuosto ; Mariangiola Dezani-Ciancaglini.

We define a novel calculus that combines a call-by-name functional core with session-based communication primitives. We develop a typing discipline that guarantees both normalisation of expressions and progress of processes and that uncovers an unexpected interplay between evaluation and&nbsp;[&hellip;]

---

On the Preciseness of Subtyping in Session Types

Tzu-chun Chen ; Mariangiola Dezani-Ciancaglini ; Alceste Scalas ; Nobuko Yoshida.

Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite&nbsp;[&hellip;]

---

Deconfined Global Types for Asynchronous Sessions

Francesco Dagnino ; Paola Giannini ; Mariangiola Dezani-Ciancaglini.

Multiparty sessions with asynchronous communications and global types play an important role for the modelling of interaction protocols in distributed systems. In designing such calculi the aim is to enforce, by typing, good properties for all participants, maximising, at the same time, the accepted&nbsp;[&hellip;]

---