Results 1 
2 of
2
Implicit typing `a la ML for the joincalculus
 Proceedings of the 8th International Conference on Concurrency Theory, volume 1243 of Lecture Notes in Computer Science
, 1997
"... We adapt the DamasMilner typing discipline to the joincalculus. The main result is a new generalization criterion that extends the polymorphism of ML to joindefinitions. We prove the correctness of our typing rules with regard to a chemical semantics. We also relate typed extensions of the core j ..."
Abstract

Cited by 47 (12 self)
 Add to MetaCart
We adapt the DamasMilner typing discipline to the joincalculus. The main result is a new generalization criterion that extends the polymorphism of ML to joindefinitions. We prove the correctness of our typing rules with regard to a chemical semantics. We also relate typed extensions of the core joincalculus to functional languages. 1 Introduction The distributed implementation of concurrent calculi with message passing raises the problem of implementing communication channels, which finally reduces to the specification of channel managers. In order to reflect this need in the language itself, a new formalism has been recently introduced : the joincalculus [2]. This calculus is similar to Milner's asynchronous ßcalculus, except that the operations of restriction, reception and replication are all combined into a single receptor definition. Such a combination yields better control over communication. In [2, 3], we relied on this locality property to model realistic distributed sys...
A ProcessModel for Linear Programs
"... Abstract. We use ℓinSolos (i.e. a typed process calculus based on the calculus of solos) in order to express computational processes generated by SℓPCF − , namely a simple programming language conceived in order to program only linear functions. We define a faithful translation of SℓPCF − on ℓinSolo ..."
Abstract
 Add to MetaCart
Abstract. We use ℓinSolos (i.e. a typed process calculus based on the calculus of solos) in order to express computational processes generated by SℓPCF − , namely a simple programming language conceived in order to program only linear functions. We define a faithful translation of SℓPCF − on ℓinSolos which make us able to process redexes of SℓPCF − in a parallel way. Afterward, we prove that a suitable observational equivalence between processes is correct w.r.t the operational semantics of SℓPCF − , via our interpretation.