PFL

LA home
Computing
FP
 λ-calculus
 PFL (λ-CCS)
 Ind.Prog.(IP)
 Haskell
 SML

 PFL
  Syntax
  Examples
  Interpreter

also see:
 λ-calculus
 Prolog
Semantics

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

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.
www:


© L. Allison   http://www.allisons.org/ll/   (or as otherwise indicated),
Created with "vi (Linux or Solaris)",  charset=iso-8859-1,  fetched Monday, 20-Nov-2017 17:44:41 EST.

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