3 results
Michele Boreale ; Luisa Collodi ; Daniele Gorla.
In the context of the stream calculus, we present an Implicit Function Theorem (IFT) for polynomial systems, and discuss its relations with the classical IFT from calculus. In particular, we demonstrate the advantages of the stream IFT from a computational point of view, and provide a few example […]
Published on June 18, 2024
Thomas Given-Wilson ; Daniele Gorla ; Barry Jay.
Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. CPC […]
Published on August 23, 2014
Daniele Gorla ; Matthew Hennessy ; Vladimiro Sassone.
We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane, which regulates the interactions between the computing body and the external environment. More precisely, […]
Published on December 20, 2005