Re-export Lower in Prologue.

src/Analysis/Abstract/Caching.hs

@@ -9,7 +9,6 @@ import Control.Abstract
 import Data.Abstract.Cache
 import Data.Abstract.Module
 import Data.Abstract.Ref
-import Data.Semilattice.Lower
 import Prologue
 
 -- | Look up the set of values for a given configuration in the in-cache.

src/Analysis/Abstract/Collecting.hs

@@ -5,7 +5,6 @@ module Analysis.Abstract.Collecting
 ) where
 
 import Control.Abstract
-import Data.Semilattice.Lower
 import Prologue
 
 -- | An analysis performing GC after every instruction.

src/Analysis/Abstract/Dead.hs

@@ -9,7 +9,6 @@ module Analysis.Abstract.Dead
 import Control.Abstract
 import Data.Abstract.Module
 import Data.Semigroup.Reducer as Reducer
-import Data.Semilattice.Lower
 import Data.Set (delete)
 import Prologue
 

src/Analysis/Abstract/Evaluating.hs

@@ -5,7 +5,7 @@ module Analysis.Abstract.Evaluating
 ) where
 
 import Control.Abstract
-import Data.Semilattice.Lower
+import Prologue
 
 -- | An analysis evaluating @term@s to @value@s with a list of @effects@ using 'Evaluatable', and producing incremental results of type @a@.
 data EvaluatingState address value = EvaluatingState

src/Control/Abstract/Environment.hs

@@ -23,7 +23,6 @@ import Data.Abstract.Environment (Environment)
 import qualified Data.Abstract.Environment as Env
 import Data.Abstract.Exports as Exports
 import Data.Abstract.Name
-import Data.Semilattice.Lower
 import Prologue
 
 -- | Retrieve the environment.

src/Control/Abstract/Primitive.hs

@@ -6,7 +6,6 @@ import Control.Abstract.Evaluator
 import Control.Abstract.Heap
 import Control.Abstract.Value
 import Data.Abstract.Name
-import Data.Semilattice.Lower
 import Data.Text (pack, unpack)
 import Prologue
 

src/Control/Abstract/Value.hs

@@ -25,8 +25,6 @@ import Data.Abstract.Name
 import Data.Abstract.Number as Number
 import Data.Abstract.Ref
 import Data.Scientific (Scientific)
-import Data.Semilattice.Lower
-import Prelude
 import Prologue hiding (TypeError)
 
 -- | This datum is passed into liftComparison to handle the fact that Ruby and PHP

src/Data/Abstract/Address.hs

@@ -6,7 +6,6 @@ import Data.Abstract.Name
 import Data.Abstract.Package (PackageInfo)
 import Data.Monoid (Last(..))
 import Data.Semigroup.Reducer
-import Data.Semilattice.Lower
 import Data.Set as Set
 import Prologue
 

src/Data/Abstract/Cache.hs

@@ -5,7 +5,6 @@ import Data.Abstract.Configuration
 import Data.Abstract.Heap
 import Data.Abstract.Ref
 import Data.Map.Monoidal as Monoidal
-import Data.Semilattice.Lower
 import Prologue
 
 -- | A map of 'Configuration's to 'Set's of resulting values & 'Heap's.

src/Data/Abstract/Environment.hs

@@ -22,7 +22,6 @@ import           Data.Abstract.Name
 import           Data.Align
 import qualified Data.List.NonEmpty as NonEmpty
 import qualified Data.Map as Map
-import           Data.Semilattice.Lower
 import           Prelude hiding (head, lookup)
 import           Prologue
 

src/Data/Abstract/Evaluatable.hs

@@ -34,7 +34,6 @@ import Data.Scientific (Scientific)
 import Data.Semigroup.App
 import Data.Semigroup.Foldable
 import Data.Semigroup.Reducer hiding (unit)
-import Data.Semilattice.Lower
 import Data.Sum
 import Data.Term
 import Prologue

src/Data/Abstract/Exports.hs

@@ -10,7 +10,6 @@ module Data.Abstract.Exports
 import Data.Abstract.Environment (Environment, unpairs)
 import Data.Abstract.Name
 import qualified Data.Map as Map
-import Data.Semilattice.Lower
 import Prelude hiding (null)
 import Prologue hiding (null)
 

src/Data/Abstract/Heap.hs

@@ -4,7 +4,6 @@ module Data.Abstract.Heap where
 import Data.Abstract.Live
 import qualified Data.Map.Monoidal as Monoidal
 import Data.Semigroup.Reducer
-import Data.Semilattice.Lower
 import Prologue
 
 -- | A map of addresses onto cells holding their values.

src/Data/Abstract/Live.hs

@@ -1,7 +1,6 @@
 {-# LANGUAGE DataKinds, GeneralizedNewtypeDeriving, TypeFamilies, TypeOperators #-}
 module Data.Abstract.Live where
 
-import Data.Semilattice.Lower
 import Data.Set as Set
 import Prologue
 

src/Data/Abstract/ModuleTable.hs

@@ -15,7 +15,6 @@ module Data.Abstract.ModuleTable
 import Data.Abstract.Module
 import qualified Data.Map as Map
 import Data.Semigroup
-import Data.Semilattice.Lower
 import GHC.Generics (Generic1)
 import Prelude hiding (lookup)
 import Prologue

src/Data/Abstract/Type.hs

@@ -10,7 +10,6 @@ module Data.Abstract.Type
 import Control.Abstract
 import Data.Abstract.Environment as Env
 import Data.Semigroup.Foldable (foldMap1)
-import Data.Semilattice.Lower
 import Prologue hiding (TypeError)
 
 type TName = Int

src/Data/Abstract/Value.hs

@@ -10,7 +10,6 @@ import Data.Coerce
 import Data.List (genericIndex, genericLength)
 import Data.Scientific (Scientific)
 import Data.Scientific.Exts
-import Data.Semilattice.Lower
 import qualified Data.Set as Set
 import Prologue
 

src/Data/Graph.hs

@@ -11,7 +11,6 @@ module Data.Graph
 import qualified Algebra.Graph as G
 import qualified Algebra.Graph.Class as Class
 import Data.Aeson
-import Data.Semilattice.Lower
 import Prologue
 
 -- | An algebraic graph with 'Ord', 'Semigroup', and 'Monoid' instances.

src/Data/Map/Monoidal.hs

@@ -14,7 +14,6 @@ module Data.Map.Monoidal
 import Data.Aeson (ToJSON)
 import qualified Data.Map as Map
 import Data.Semigroup.Reducer as Reducer
-import Data.Semilattice.Lower
 import Prelude hiding (lookup)
 import Prologue hiding (Map)
 

src/Data/Range.hs

@@ -9,7 +9,6 @@ module Data.Range
 
 import Data.Aeson
 import Data.JSON.Fields
-import Data.Semilattice.Lower
 import Prologue
 
 -- | A half-open interval of integers, defined by start & end indices.

src/Data/Record.hs

@@ -4,7 +4,6 @@ module Data.Record where
 import Data.Aeson
 import Data.JSON.Fields
 import Data.Kind
-import Data.Semilattice.Lower
 import Prologue
 
 -- | A type-safe, extensible record structure.

src/Data/Span.hs

@@ -16,7 +16,6 @@ import Proto3.Wire.Decode as Decode
 import Proto3.Wire.Encode as Encode
 import qualified Data.Aeson as A
 import Data.JSON.Fields
-import Data.Semilattice.Lower
 import GHC.Stack
 import Prologue
 

src/Language/Go/Syntax.hs

@@ -7,7 +7,6 @@ import qualified Data.Abstract.Package as Package
 import           Data.Abstract.Path
 import           Data.Aeson
 import           Data.JSON.Fields
-import           Data.Semilattice.Lower
 import qualified Data.Text as T
 import           Diffing.Algorithm
 import           Prologue

src/Language/PHP/Syntax.hs

@@ -7,7 +7,6 @@ import           Data.Abstract.Path
 import qualified Data.Text as T
 import           Data.JSON.Fields
 import qualified Data.Language as Language
-import           Data.Semilattice.Lower
 import           Diffing.Algorithm
 import           Prologue hiding (Text)
 

src/Language/Python/Syntax.hs

@@ -10,7 +10,6 @@ import           Data.JSON.Fields
 import qualified Data.Language as Language
 import qualified Data.List.NonEmpty as NonEmpty
 import           Data.Mergeable
-import           Data.Semilattice.Lower
 import qualified Data.Text as T
 import           Diffing.Algorithm
 import           GHC.Generics

src/Language/Ruby/Syntax.hs

@@ -8,7 +8,6 @@ import           Data.Abstract.Path
 import qualified Data.Text as T
 import           Data.JSON.Fields
 import qualified Data.Language as Language
-import           Data.Semilattice.Lower
 import           Diffing.Algorithm
 import           Prologue
 import           System.FilePath.Posix

src/Language/TypeScript/Syntax.hs

@@ -10,7 +10,6 @@ import           Data.Aeson
 import           Data.JSON.Fields
 import qualified Data.Language as Language
 import qualified Data.Map as Map
-import           Data.Semilattice.Lower
 import qualified Data.Text as T
 import           Diffing.Algorithm
 import           Prologue

src/Prologue.hs

@@ -20,6 +20,7 @@ import Data.Map as X (Map)
 import Data.Maybe as X
 import Data.Monoid (Alt (..))
 import Data.Sequence as X (Seq)
+import Data.Semilattice.Lower as X (Lower(..))
 import Data.Set as X (Set)
 import Data.Sum as X (Sum, Element, Elements, (:<), (:<:), Apply (..), inject)
 import Data.Text as X (Text)