summaryrefslogtreecommitdiff
path: root/compiler/utils/BooleanFormula.hs
diff options
context:
space:
mode:
authorGabor Greif <ggreif@gmail.com>2016-12-16 14:00:15 +0100
committerGabor Greif <ggreif@gmail.com>2016-12-16 14:00:15 +0100
commited4cf039092a8cc5bea78dedb845f8e2db3f49b8 (patch)
tree72b95e4653413d133b77ec2cf8b2bbaac0d2e487 /compiler/utils/BooleanFormula.hs
parent6fecb2a4dec6d1a4bfb5655ef5fc2a3e475954a4 (diff)
downloadhaskell-ed4cf039092a8cc5bea78dedb845f8e2db3f49b8.tar.gz
Typos in comments
Diffstat (limited to 'compiler/utils/BooleanFormula.hs')
-rw-r--r--compiler/utils/BooleanFormula.hs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/utils/BooleanFormula.hs b/compiler/utils/BooleanFormula.hs
index 13f6e21f31..1509321e62 100644
--- a/compiler/utils/BooleanFormula.hs
+++ b/compiler/utils/BooleanFormula.hs
@@ -86,7 +86,7 @@ The smart constructors (`mkAnd` and `mkOr`) do some attempt to simplify expressi
Implemented by mkAnd' / mkOr'
3. Conjunction with false, disjunction with true is simplified, i.e.
`mkAnd [mkFalse,x]` becomes `mkFalse`.
- 4. Common subexpresion elimination:
+ 4. Common subexpression elimination:
`mkAnd [x,x,y]` is reduced to just `mkAnd [x,y]`.
This simplification is not exhaustive, in the sense that it will not produce