http://martinfowler.com/eaaDev/EventSourcing.html http://martinfowler.com/articles/lmax.html -- -- -- Regards, KC
http://martinfowler.com/eaaDev/EventSourcing.html
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe <at> haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
It´´s a very iteresting concept. The Workflow Monad transformer [1], in Control.Workflow perform logging and recovery of application istate from the log created. It has no implementation of roll-back or limited recovery upto a point, but this is easy to implement. It also has many inspection and synchronization primitives. It has been used also for translating the log of a program and recovering the state in another machine. The log can be pretty-printed for debugging. [1] http://hackage.haskell.org/package/Workflow 2012/9/30 KC <kc1956 <at> gmail.com>: > http://martinfowler.com/eaaDev/EventSourcing.html > > http://martinfowler.com/articles/lmax.html > > > -- > -- > Regards, > KC > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe <at> haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe -- -- Alberto.
Hi, On Sun, Sep 30, 2012 at 4:22 AM, Alberto G. Corona <agocorona <at> gmail.com> wrote: > It´´s a very iteresting concept. > > The Workflow Monad transformer [1], in Control.Workflow perform > logging and recovery of application istate from the log created. > It has no implementation of roll-back or limited recovery upto a > point, but this is easy to implement. Is Control.Workflow similar with acid-state with respect to the way you recovery the current state? > It also has many inspection and synchronization primitives. It has > been used also for translating the log of a program and recovering the > state in another machine. The log can be pretty-printed for > debugging. Can you "somehow" recover impure (IO) computations? > [1] http://hackage.haskell.org/package/Workflow Regards, Marcelo > 2012/9/30 KC <kc1956 <at> gmail.com>: >> http://martinfowler.com/eaaDev/EventSourcing.html >> >> http://martinfowler.com/articles/lmax.html >> >> >> -- >> -- >> Regards, >> KC >> >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe <at> haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe > > > > -- > Alberto. > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe <at> haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,Marcelo,
Hi,Is Control.Workflow similar with acid-state with respect to the way
On Sun, Sep 30, 2012 at 4:22 AM, Alberto G. Corona <agocorona <at> gmail.com> wrote:
> It´´s a very iteresting concept.
>
> The Workflow Monad transformer [1], in Control.Workflow perform
> logging and recovery of application istate from the log created.
> It has no implementation of roll-back or limited recovery upto a
> point, but this is easy to implement.
you recovery the current state?Can you "somehow" recover impure (IO) computations?
> It also has many inspection and synchronization primitives. It has
> been used also for translating the log of a program and recovering the
> state in another machine. The log can be pretty-printed for
> debugging.
> [1] http://hackage.haskell.org/package/Workflow
Regards,
Marcelo
> 2012/9/30 KC <kc1956 <at> gmail.com>:
>> http://martinfowler.com/eaaDev/EventSourcing.html
>>
>> http://martinfowler.com/articles/lmax.html
>>
>>
>> --
>> --
>> Regards,
>> KC
>>
>> _______________________________________________
>> Haskell-Cafe mailing list
>> Haskell-Cafe <at> haskell.org
>> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
>
> --
> Alberto.
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe <at> haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe <at> haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
On 09/30/2012 02:46 AM, KC wrote: > http://martinfowler.com/eaaDev/EventSourcing.html > > http://martinfowler.com/articles/lmax.html > > Sure, why not? See http://hackage.haskell.org/package/cqrs-0.8.0 and http://hackage.haskell.org/package/cqrs-example-0.8.0 for an example application. I should note that the "cqrs" package API is by no means finalized; there are some limitations(*) to the current implementation, but I've not had time to actually get rid of those limitations. (*) The major ones being the requirement for a global version number and lack of streaming event sourcing.
On Sat, Sep 29, 2012 at 8:46 PM, KC <kc1956 <at> gmail.com> wrote: > http://martinfowler.com/eaaDev/EventSourcing.html > > http://martinfowler.com/articles/lmax.html This notion of "Capture all changes to an application state as a sequence of events" sounds a lot like what John Carmack did in Quake 3 [1]: > I settled on combining all forms of input into a single system event queue, similar to the windows message queue. My original intention was to just rigorously define where certain functions were called and cut down the number of required system entry points, but it turned out to have much stronger benefits. [1]: http://www.team5150.com/~andrew/carmack/johnc_plan_1998.html#d19981014
RSS Feed