Types and Type Inference for Ambient and Process Mobility

A new kind of ambient calculi is presented, where the open capability is replaced by direct mobility of naked processes, while the associated type systems are algorithmic in the sense that they directly provide type inference procedures. The calculus comes equipped with a labelled transition system in which types play a major role: this system allows us to show interesting algebraic laws. Types express, as usual, the communication, access and mobility properties of the modelled system; inferred types express the minimal constraints required for the system to well behave.