Proposes a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed λ-calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed λ-calculus, intuitionistic logic and Cartesian closed categorie
AbstractWe obtain a new formalism for concurrent object-oriented languages by extending Abadi and Ca...
π-calculus is a calculus for modeling dynamically changing configurations of a network of communicat...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
In this work we describe a simple calculus (called interaction calculus) for the representation of c...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
Abstract. This paper presents a logical approach to the translation of functional calculi into concu...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
We reconsider work by Bellin and Scott in the 1990s on R. Milner and S. Abramsky's encoding of linea...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
Various languages and algebraic structures have been recently proposed for denoting parallel computa...
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as seque...
Abstract. We motivate and present a logical semantic approach to types for concurrency and to the so...
AbstractWe obtain a new formalism for concurrent object-oriented languages by extending Abadi and Ca...
π-calculus is a calculus for modeling dynamically changing configurations of a network of communicat...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
In this work we describe a simple calculus (called interaction calculus) for the representation of c...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
1 Introduction The study of concurrency is often conducted with the aid of process calculi. Undoubt-...
Abstract. This paper presents a logical approach to the translation of functional calculi into concu...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
We reconsider work by Bellin and Scott in the 1990s on R. Milner and S. Abramsky's encoding of linea...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
Various languages and algebraic structures have been recently proposed for denoting parallel computa...
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as seque...
Abstract. We motivate and present a logical semantic approach to types for concurrency and to the so...
AbstractWe obtain a new formalism for concurrent object-oriented languages by extending Abadi and Ca...
π-calculus is a calculus for modeling dynamically changing configurations of a network of communicat...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
DOI
Add to ORKG