On 10/08/2011 12:46 PM, Jan-Willem Maessen wrote:
On Fri, Oct 7, 2011 at 2:46 PM, Brandon Moore wrote:
Margnus Carlsson did something monadic several years ago.
http://dl.acm.org/citation.cfm?doid=581478.581482
Perhaps there is an implementation on Hackage or on his website.
This stuff also
On Fri, Oct 7, 2011 at 2:46 PM, Brandon Moore wrote:
>> Margnus Carlsson did something monadic several years ago.
>>
>> http://dl.acm.org/citation.cfm?doid=581478.581482
>>
>> Perhaps there is an implementation on Hackage or on his website.
>>
>> This stuff also goes by the moniker "adaptive compu
David Barbour wrote:
Heinrich Apfelmus wrote:
Even then, events and behaviors are "one abstraction level too low". In my
opinion, you are better off with a library/approach geared directly towards
incremental computations.
I believe behaviors are precisely the 'right' abstraction if the goal i
> From: Peter Gammie Oct 6. 2011 6:58 PM
>
> Ben,
>
> On 07/10/2011, at 8:55 AM, Benjamin Redelings I wrote:
>
>> My question is, roughly, is there already an existing framework for
> incremental
>> evaluation in Haskell?
>
> Margnus Carlsson did something monadic several years ago.
>
> h
On Fri, Oct 7, 2011 at 3:17 AM, Heinrich Apfelmus wrote:
> FRP is somewhat orthogonal to incremental computation because FRP is
> focusing on expressiveness while incremental computation focuses on
> performance. You can formulate some incremental algorithms in terms of FRP,
> but you need specia
David Barbour wrote:
Benjamin Redelings wrote:
My question is, roughly, is there already an existing framework for
incremental evaluation in Haskell?
Functional Reactive Programming can model this sort of 'change over
time' incremental computation, but I doubt you'd get a performance
benefit f
Hi Benjamin,
My question is, roughly, is there already an existing framework for
> incremental evaluation in Haskell?
>
We at Utrecht have done some work on this:
http://people.cs.uu.nl/andres/Incrementalization/
Simply put, if your computation is a fold/catamorphism, then you can easily
take ad
Functional Reactive Programming can model this sort of 'change over time'
incremental computation, but I doubt you'd get a performance benefit from it
unless your operations are considerably more expensive than '+' on numbers.
Look into the 'Reactive' library, and Conal Elliott's paper on it (Push-
Ben,
On 07/10/2011, at 8:55 AM, Benjamin Redelings I wrote:
> My question is, roughly, is there already an existing framework for
> incremental
> evaluation in Haskell?
Margnus Carlsson did something monadic several years ago.
http://dl.acm.org/citation.cfm?doid=581478.581482
Perhaps there is
Hi all,
I'm not sure this is the right forum for this question. If so,
please let me know where else might be more appropriate. My question
is, roughly, is there already an existing framework for incremental
evaluation in Haskell? That is, if I write a program using Haskell, and
then chang
10 matches
Mail list logo
