summaryrefslogtreecommitdiff
path: root/compiler/utils/BooleanFormula.hs
diff options
context:
space:
mode:
authorHerbert Valerio Riedel <hvr@gnu.org>2014-09-15 08:37:30 +0200
committerHerbert Valerio Riedel <hvr@gnu.org>2014-09-15 08:37:39 +0200
commitc0fa383d9109800a4e46a81b418f1794030ba1bd (patch)
tree19dc80e4d266eb6fd7b56b6f61d4f7ed4f10a097 /compiler/utils/BooleanFormula.hs
parent004c5f4fec78414943d788c2a8b42a4500272949 (diff)
downloadhaskell-c0fa383d9109800a4e46a81b418f1794030ba1bd.tar.gz
Export `Traversable()` and `Foldable()` from Prelude
This exposes *only* the type-classes w/o any of their methods. This is the very first step for implementing BPP (see #9586), which already requires breaking up several import-cycles leading back to `Prelude`. Ideally, importing `Prelude` should be avoided in most `base` modules, as `Prelude` does not define any entities, but rather re-exports existing ones. Test Plan: validate passes Reviewers: ekmett, austin Reviewed By: ekmett, austin Subscribers: simonmar, ezyang, carter Differential Revision: https://phabricator.haskell.org/D209 GHC Trac Issues: #9586
Diffstat (limited to 'compiler/utils/BooleanFormula.hs')
-rw-r--r--compiler/utils/BooleanFormula.hs4
1 files changed, 4 insertions, 0 deletions
diff --git a/compiler/utils/BooleanFormula.hs b/compiler/utils/BooleanFormula.hs
index 8620ef555d..5925bdb758 100644
--- a/compiler/utils/BooleanFormula.hs
+++ b/compiler/utils/BooleanFormula.hs
@@ -1,3 +1,5 @@
+{-# LANGUAGE CPP #-}
+
--------------------------------------------------------------------------------
-- | Boolean formulas without quantifiers and without negation.
-- Such a formula consists of variables, conjunctions (and), and disjunctions (or).
@@ -18,8 +20,10 @@ module BooleanFormula (
import Data.List ( nub, intersperse )
import Data.Data
+#if __GLASGOW_HASKELL__ < 709
import Data.Foldable ( Foldable )
import Data.Traversable ( Traversable )
+#endif
import MonadUtils
import Outputable