Expressions as processes
Richard Kennaway, M. Ronan Sleep · 1982
We argue that the 'equal civil rights' principle inherent in the lambda calculus base of applicative languages may be extended to encompass parallelism. In our model, all applicative expressions are viewed as processes, whether they represent primitives such as integers, or complex higher order functions.