We may also be able to discuss type principles which give disciplined ways of combining these idioms to form a process with desired behaviour. 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. It is a joint work with Pierpaolo Degano. Our notion of causality combines the dependencies given by the syntactic structure of processes with those originated by passing names. Other non-interleaving semantics are investigated and compared. An extension of the above theory to full Facile is under development.