Type Inference for the receptive distributed Pi-calculus
Résumé
In this paper we study the type inference problem for an extended version of the type system of d_1^r very closed to the one of Hennessy and Riely's d. These are distributed Pi-calculus involving explicit notions of locations and migration where the location space is flat and communication is local. Moreover, location names are typed and we use an explicit subtyping relation over location types that enable us to define a notion of principal typing. We provide an inference type algorithm computing a principal type for all typable term.
Domaines
Autre [cs.OH]
Loading...