Dataflow and Comonads was Re: [Haskell-cafe] Monads in Scala, ...

[Shae Matijs Erisson]

Greg Woodhouse <gregory.woodhouse at sbcglobal.net> writes:

> Maybe this is a different topic, but exploring concurrency in Haskell is
> definitely on my "to do" list, but this is really a bit of a puzzle.  One
> thing I've been thinking lately is that in functional programming the process
> is really the wrong abstraction (computation is reduction, not a sequence of
> steps performed in temporal order). But what is concurrency if their are no
> processes to "run" concurrently? I've beren thinking about action systems and
> non-determinism, but am unsure how the pieces really fit together.

Maybe dataflow languages like Lucid Synchrone, Esterel and Lustre?
http://en.wikipedia.org/wiki/Dataflow_language
http://en.wikipedia.org/wiki/Synchronous_programming_language

For dataflow in Haskell, see Uustalu & Vene's comonads paper:
http://lambda-the-ultimate.org/node/view/988

I do wish I could find the source code from this paper online, I'd rather not
type it in by hand. Do researchers usually manually transcribe code?
-- 
Shae Matijs Erisson - http://www.ScannedInAvian.com/ - Sockmonster once said:
You could switch out the unicycles for badgers, and the game would be the same.