Permalink
Browse files

Merge pull request #14 from jrheard/patch-2

Fix a typo in the STM followup post
  • Loading branch information...
2 parents 7a46c4a + 0a6395c commit a9720251111981777a1c0ebfd8e13531bf211420 @joeduffy committed on GitHub Dec 24, 2016
Showing with 1 addition and 1 deletion.
  1. +1 −1 _posts/2010-05-16-more-thoughts-on-transactional-memory.md
@@ -55,7 +55,7 @@ out, are a convenient way of implementing this requirement.
You will observe a similar architecture in other places, including in some languages
that have adopted TM. Haskell has moved in this direction. Everything
is purely functional and so, of course, no state is mutated in an unsafe way by default.
-However, with the introduction of concucrrency comes mutable cells for message passing
+However, with the introduction of concurrency comes mutable cells for message passing
and with parallelism comes indeterminism. You can push the state management
problem up indefinitely, but at the top there are almost always mutable operations
on real-world state (even if it is "just I/O"). Haskell programs have a safe

0 comments on commit a972025

Please sign in to comment.