LA home
 PFL (λ-CCS)


also see:

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(||).


  • [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.
www #ad:

↑ © L. Allison,   (or as otherwise indicated).
Created with "vi (Linux)",  charset=iso-8859-1,   fetched Wednesday, 06-Jul-2022 22:00:58 UTC.

Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off.