On 26.09 01:01, David Menendez wrote:
We'll also define the injection combinator from Kieburtz's paper[1]:
(.) :: Functor d = d a - b - d b
d . a = fmap (const a) d
We add some nice combinators:
(-) :: Comonad co = (co a - co b) - (co b - co c) - co a - co c
a - b = b . a
infixr -
(--)
Dear Dave,
Thanks for the nice propaganda!
A few comments regarding the points you made in your message.
Ineffeciency of fibo-like programs: Your observations are true. But this is a
comonadic interpreter analogous to the cbv monadic interpreter. One can also
define an analogue to the cbn
Tarmo Uustalu writes:
| We would like to announce our new paper
|
| The essence of dataflow programming
|
| http://cs.ioc.ee/~tarmo/papers/essence.pdf
|
| which describes a novel comonadic foundation of dataflow computing,
| incl. semantics of dataflow languages a la Lucid or Lustre. The
|
Dear Haskell subscribers,
We would like to announce our new paper
The essence of dataflow programming
http://cs.ioc.ee/~tarmo/papers/essence.pdf
which describes a novel comonadic foundation of dataflow computing,
incl. semantics of dataflow languages a la Lucid or Lustre. The
central point is
