PFL Examples

home1 home2
and the

 PFL (code)

Also see:
  λ ex'
  • [buffer] -- bounded buffer process
  • [factorial] -- in parallel ||
  • [server] -- and clients
  • [merge sort]
  • [Prime numbers] -- || sieve
  • [Hamming numbers] -- by || processes
  • [pass actions] -- etc. down channels
  • Deadlock
    let ch1=chan, ch2=chan
    in ch1!1 -> ch2!2 -> stop ||
       ch2?x -> ch1?y -> output!x+y -> stop
    { Deadlock. }
    -- one process wants to interact on ch1 and then (->) on ch2, the other one v.v..--(
|| factorial:

Coding Ockham's Razor, L. Allison, Springer

A Practical Introduction to Denotational Semantics, L. Allison, CUP

free op. sys.
free office suite
~ free photoshop
web browser

|   choice
|| parallel
-> sequence
? input act
! output act
chan new channel

© L. Allison   (or as otherwise indicated),
Faculty of Information Technology (Clayton), Monash University, Australia 3800 (6/'05 was School of Computer Science and Software Engineering, Fac. Info. Tech., Monash University,
was Department of Computer Science, Fac. Comp. & Info. Tech., '89 was Department of Computer Science, Fac. Sci., '68-'71 was Department of Information Science, Fac. Sci.)
Created with "vi (Linux + Solaris)",  charset=iso-8859-1,  fetched Thursday, 25-Jul-2024 05:18:02 AEST.