Parallel machine

From HaskellWiki
Revision as of 16:26, 12 March 2009 by Lemming (talk | contribs) (a small thought that I had)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

There are two reasonable ways to define an applicative functor instance for lists. Both of them simulate kinds of parallel computers:

  • The plain instance simulates a non-deterministic computer. This instance can also be generalized to monads.
  • The applicative functor instance of the ZipList wrapper simulates a SIMD (single-instruction multiple-data) computer.
Retrieved from "https://wiki.haskell.org/index.php?title=Parallel_machine&oldid=26944"