Abstract. We motivate and present a logical semantic approach to types for concurrency and to the soundness of related systems. The approach is illustrated by the development of a generic type system for the π-calculus, which may be instantiated for specific notions of typing by extension with adequate subtyping principles. Soundness of our type system is established using a logical predicate technique, based on a compositional spatial logic interpretation of types.
Closest to our work is REF , where a generic type system for the pi-calculusparameterized on the subtyping relation -is proposed.
Logical Semantics of Types for Concurrency
CALCO
Computer Science