As Magnus pointed out in his (very clever) paper, the Applicative interface allows for more precise/efficient tracking of dependencies, in that it eliminates accidental sequentiality imposed by the Monad interface. (Magnus didn't mention Applicative by name, as his paper preceded Idiom/Applicative.) However, I don't see an Applicative instance in the library. - Conal On Thu, Nov 13, 2008 at 7:46 PM, Don Stewart <dons@galois.com> wrote:
Magnus writes:
Thanks to Peter Jonsson, the source is now on hackage:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Adaptive
Cheers, Magnus
Donnie Jones wrote:
Hello sanzhiyan,
I believe this is the same paper, the pdf is available here: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.3014
Cheers. __ Donnie
On Thu, Nov 13, 2008 at 9:02 PM, Don Stewart <dons@galois.com <mailto:dons@galois.com>> wrote:
I sit next to the author, CC'd.
-- Don
sanzhiyan: > I'm looking for the source code of the library for adaptive computations > exposed in Magnus Carlsson's "Monads for Incremental Computing"[1], but > the link in the paper is broken. > So, does anyone have the sources or knows how to contact the author? > > [1] http://portal.acm.org/citation.cfm?id=581482
> _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org <mailto:Haskell-Cafe@haskell.org> > http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org <mailto:Haskell-Cafe@haskell.org> http://www.haskell.org/mailman/listinfo/haskell-cafe
----- End forwarded message ----- _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe