Some hints on the new work can be supplied, if appropriate. It integrates eager and lazy functional computation and describes the intended complexity behavior in both cases. It provides for communication over logic variables and for suspension on their instantiation. Both mechanisms come naturally with parallel composition and declaration. Using explicit references we guarantee that functional arguments are evaluated at most once.
Explicit references are a special form of logic variables.
These are needed too for representing lazy functional control. We show that the Weak Late pi-calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, due e.g. to communication, are explicitly handled via suitable constructors. The approach presented here generalizes the one proposed in a previous paper. The pi-calculus transitional semantics is reduced to a SOS framework fitting with a mild generalization of the De Simone format, and we retrieve a complete axiomatization of the Strong Late semantics by turning rules into equations. The main consequence of the results presented in the paper is that the irredundant unfolding can be constructed also for a single agent, and then a minimal realization can be derived from it employing the ordinary partition refinement algorithm.