Thanks for the reality check, Robin.  Hm.  Any suggestions (from anyone) on what to name this thing?  On the other hand, maybe it's not worth keeping.

  - Conal

On Tue, Nov 25, 2008 at 11:11 AM, Robin Green <greenrd@greenrd.org> wrote:
On Mon, 24 Nov 2008 20:27:34 -0800
"Conal Elliott" <conal@conal.net> wrote:

> I renamed 'stateE' and 'stateE_' to' mealy' and 'mealy_' in
> reactive-0.9.4 (just released).  I've been meaning to change these
> names for a while now. I prefer these new names as being more clear &
> specific and connecting clearly to automata theory rather than to
> imperative programming.

I don't think mealy is as general as a Mealy machine, so this seems
misleading. A Mealy machine can jump to different states depending on
its input. If 's' is the state type, and 'b' the input type (which
seems to me to be the natural way to interpret it), that
"conditional jumping" feature isn't present.

I think

\f g a e -> f <$> scanlE g a e

is precisely a *Moore* machine, though? If so, scanlE is a particular
kind of Moore machine in which f is the identity. And so are the other
scanl* functions in the library - right?
--
Robin
_______________________________________________
Reactive mailing list
Reactive@haskell.org
http://www.haskell.org/mailman/listinfo/reactive