[Haskell-cafe] how would I do this properly in Haskell?

[Dennis Raddle]

I'm an advanced beginner, and I'm finding it hard to comprehend
Data.Machine.Moore. Is there a way to explain more to me how this would
look in practice? Or is there another way to organize it that is less
"computer-sciency" and I could work with more easily?

D

On Thu, Aug 24, 2017 at 9:13 PM, John Wiegley <johnw at newartisans.com> wrote:

> >>>>> "DR" == Dennis Raddle <dennis.raddle at gmail.com> writes:
>
> DR> I have a search optimization problem in which there are a lot of
> DR> individual fitness functions which combine scores to give an overall
> DR> fitness level.
>
> DR> Each fitness function will be associated with data, both initial data
> to
> DR> configure it, and a cache that it maintains.
>
> This sounds a lot like a network of Moore machines, which could be combined
> monoidally to arrive at the final fitness function.
>
> --
> John Wiegley                  GPG fingerprint = 4710 CF98 AF9B 327B B80F
> http://newartisans.com                          60E1 46C4 BD1A 7AC1 4BA2
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20170824/5f2f9d6c/attachment.html>