PFL

The PFL interpreter is based on the [λ-calculus] interpreter and was inspired by CCS and the original PFL[Hol83,Mit84]. PFL adds to λ extra operators for input (?) & output (!) actions, sequences of actions (->), nondeterministic choice (|), and parallel composition(||).

October 2022: In the 1980s and 1990s I wrote an interpreter for PFL in Pascal. When the wwweb came along I put the interpreter on the Computer Science web server as a runnable cgi-bin program. Changes to the (later) Faculty of Information Technology (FIT) and Monash University web servers broke quite a few cgi-bin programs. I had always intended to translate the interpreter from Pascal to Java but Mozilla etc. "went off" Java. Finally I translated it into Javascript instead; see [click]. — L.A.

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.