GCC and static analysis
Posted Apr 22, 2012 17:29 UTC (Sun) by khim
In reply to: GCC and static analysis
Parent article: GCC and static analysis
Is it true what someone said: to parallelize a Haskell program needs the mere setting of a switch?
This is exaggeration but with a kernel of truth. Programs in functional languages are usually easily parallelizable by a compiler if the underlying algorithm is parallelizable. But it is possible to write even well-parallelizable algorithm in such a way as to make it impossible. This is an art, though - and an ugly one. Trivial proof-of-concept: implement Turing Machine on top of Haskell, implement your algorithm on top of said machine… mission accomplished.
to post comments)