|
The PFL interpreter, [e.g.], is based on the
[λ-calculus]
interpreter and was inspired by CCS and the original PFL[Hol83,Mit84].
The trace shows values exchanged over all channels.
output is the standard output channel.
The user's process is run in parallel (||) with
the input process (not implemented) and the output process.
If more than two processes remain at the end this
may be because of deadlock.
References
- [Mit84] K. Mitchell. A user's guide to PFL.
Dept. of Computer Science, University of Edinburgh, 1984.
- [Hol83] S. Holmstrom.
PFL: a functional language for parallel programming and
its implementation.
Programming Methodology Group, University of Goteborg
and Chalmers University of Technology, 1983.
- Also search for one or more, but not too many, of
[ pfl pfp ccs
csp pi calculus ]
in
the [bibliography].
|
|