
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. Please update your code if you use either function. David -- would you tweak the Events tutoriahttp://netsuperbrain.com/blog/posts/introducing-reactive-events/l accordingly? - Conal

On Mon, 24 Nov 2008 20:27:34 -0800
"Conal Elliott"
I renamed 'stateE' and 'stateE_' to' mealy' and 'mealy_' in reactive-0.9.4 (just released).
Don't you mean reactive 0.9.3? Also, this page http://haskell.org/haskellwiki/Reactive/Versions which is linked from the main wiki page, is very out of date. -- Robin

On 25 Nov 2008, at 10:21, Robin Green wrote:
On Mon, 24 Nov 2008 20:27:34 -0800 "Conal Elliott"
wrote: reactive-0.9.4 (just released).
Resolving dependencies... cabal: cannot configure reactive-0.9.3. It requires checkers >=0.1.2 There is no available version of checkers that satisfies >=0.1.2
I recommend you do a darcs get of the various bits, reactive is being developed very fast at the moment, here's the locations of the various repos: checkers: http://code.haskell.org/checkers/ Unamb: http://code.haskell.org/unamb/ MemoTrie: http://code.haskell.org/MemoTrie/ TypeCompose: http://darcs.haskell.org/packages/TypeCompose/ vector-space: http://code.haskell.org/vector-space/ FieldTrip: http://code.haskell.org/FieldTrip/ reactive: http://code.haskell.org/reactive/ reactive-glut: http://code.haskell.org/reactive-glut/ reactive-fieldtrip: http://code.haskell.org/reactive-fieldtrip/ With checkouts from there, everything should build fine. Hope that helps. Bob

On Tue, 25 Nov 2008 11:17:33 +0100
Thomas Davie
checkers: http://code.haskell.org/checkers/
With checkouts from there, everything should build fine.
It doesn't - I just pulled from the above URL and darcs said "No remote changes to pull in!"

On 25 Nov 2008, at 12:37, Robin Green wrote:
On Tue, 25 Nov 2008 11:17:33 +0100 Thomas Davie
wrote: checkers: http://code.haskell.org/checkers/
With checkouts from there, everything should build fine.
It doesn't - I just pulled from the above URL and darcs said "No remote changes to pull in!"
Blimeh, so it doesn't! Having said that, I just hacked the version number requirement, and got a working reactive, I guess conal forgot to push a couple of things last night. Bob

Thanks Bob, for gathering this list into one place.
I do intend to keep Hackage up to date with stable and consistent versions
of all of the libraries below. And I usually push and release as part of
one process.
- Conal
On Tue, Nov 25, 2008 at 2:17 AM, Thomas Davie
On 25 Nov 2008, at 10:21, Robin Green wrote:
On Mon, 24 Nov 2008 20:27:34 -0800
"Conal Elliott"
wrote: reactive-0.9.4 (just released).
Resolving dependencies... cabal: cannot configure reactive-0.9.3. It requires checkers >=0.1.2 There is no available version of checkers that satisfies >=0.1.2
I recommend you do a darcs get of the various bits, reactive is being developed very fast at the moment, here's the locations of the various repos:
checkers: http://code.haskell.org/checkers/ Unamb: http://code.haskell.org/unamb/ MemoTrie: http://code.haskell.org/MemoTrie/ TypeCompose: http://darcs.haskell.org/packages/TypeCompose/ vector-space: http://code.haskell.org/vector-space/ FieldTrip: http://code.haskell.org/FieldTrip/ reactive: http://code.haskell.org/reactive/ reactive-glut: http://code.haskell.org/reactive-glut/ reactive-fieldtrip: http://code.haskell.org/reactive-fieldtrip/
With checkouts from there, everything should build fine.
Hope that helps.
Bob
_______________________________________________ Reactive mailing list Reactive@haskell.org http://www.haskell.org/mailman/listinfo/reactive

Oops! I had forgotten to push checkers. Now checkers-0.1.2 is on Hackage.
The new bit is for binary relations, and particularly Ord. Added to test
the Improving data type.
Yes, I did mean 0.9.3. It's the latest.
Sorry about the turbulence.
- Conal
On Tue, Nov 25, 2008 at 1:21 AM, Robin Green
On Mon, 24 Nov 2008 20:27:34 -0800 "Conal Elliott"
wrote: reactive-0.9.4 (just released).
Resolving dependencies... cabal: cannot configure reactive-0.9.3. It requires checkers >=0.1.2 There is no available version of checkers that satisfies >=0.1.2 _______________________________________________ Reactive mailing list Reactive@haskell.org http://www.haskell.org/mailman/listinfo/reactive

On Mon, 24 Nov 2008 20:27:34 -0800
"Conal Elliott"
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

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
On Mon, 24 Nov 2008 20:27:34 -0800 "Conal Elliott"
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
participants (3)
-
Conal Elliott
-
Robin Green
-
Thomas Davie