Nielson et al. present an approach using flow logic to represent programming notations in process calculi. Flow logic is usually used in static analysis for language paradigms, including imperative, functional, and concurrent features. The lambda calculus is typically used with flow logic, and the authors expand the use of flow logic to process calculus. Type systems are used as an example of how to represent flow logic. The authors then describe the syntax and semantics of process calculus and how to match it with flow logic in terms of programming notations.

I recommend this paper to readers who are interested in understanding the syntax and semantics of process calculi and how the transformation from lambda calculus to process calculi enables the use of flow logic in process calculi.