|
|
|
|
|
|
by ychen306
2440 days ago
|
|
|
> Functional programming doesn't have state, so you don't need locks, so you can get better concurrency. This is not true. Many algorithms are intrinsically imperative (e.g., quicksort). You can represent it using some monads in Haskell to hide this, but in the end your code is still imperative; and if you want to parallelize it, you still have to think about synchronization. |
|
|