# Difference between revisions of "Parallel machine"

From HaskellWiki

(a small thought that I had) |
(Category:Applicative Functor) |
||

Line 2: | Line 2: | ||

Both of them simulate kinds of parallel computers: |
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 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. |
+ | * The applicative functor instance of the <hask>ZipList</hask> wrapper simulates a [[SIMD]] (single-instruction multiple-data) computer. |

[[Category:Idioms]] |
[[Category:Idioms]] |
||

− | [[Category: |
+ | [[Category:Applicative Functor]] |

## Latest revision as of 21:13, 1 November 2009

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.