[Haskell-cafe] Re: Incremental trasnformations (not Haskell topic)

[Ryan Ingram]

See "Adaptive Functional Programming" by Acar et al.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.2257

Doesn't talk about OO specifically, but rather how to make "updatable"
computations in a mutable language.

There's a Haskell implementation, too.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Adaptive

  -- ryan

2008/12/28 frantisek kocun <frantisek.kocun at gmail.com>:
> Still nobody? Maybe I didn't write it clear. So one more time:
>
> I have a list of numbers (say Int)
> numberList = [1:Int,2,3,1,2,6,7,8]
> and a number
> sumOfNumberList = sum numberList
> and here comes the question. Imagine the list numberLists is mutable (that's
> why in topic is "not Haskell question") so the calculation doesn't occur
> only once but every time something changed in the list (listener pattern).
> (If the lis tis java List and Int is java Integer, every acces to list
> should trigger event to its listeners, but if I use list of another objects
> e.g. Item with value, every access to list should trigger event to its
> listeners as well as every modification of object Item should triggers its
> listeners (list) and that in turn triggers its listeners) How to make
> transformation of often used functions (map, sum, forall, filter, exists) to
> listeners in OO language? Is there anything (any tool, any paper, any
> blog...) about it?
>
> Thanks
>
> Fero
>
> PS If nobody answers I really stop asking non Haskell questions in this
> mailling list:)
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>