diff --git a/HaskellForMaths.cabal b/HaskellForMaths.cabal
--- a/HaskellForMaths.cabal
+++ b/HaskellForMaths.cabal
@@ -1,5 +1,5 @@
    Name:                HaskellForMaths
-   Version:             0.4.6
+   Version:             0.4.7
    Category:            Math
    Description:         A library of maths code in the areas of combinatorics, group theory, commutative algebra, and non-commutative algebra. The library is mainly intended as an educational resource, but does have efficient implementations of several fundamental algorithms.
    Synopsis:            Combinatorics, group theory, commutative algebra, non-commutative algebra
diff --git a/Math/Algebras/VectorSpace.hs b/Math/Algebras/VectorSpace.hs
--- a/Math/Algebras/VectorSpace.hs
+++ b/Math/Algebras/VectorSpace.hs
@@ -6,7 +6,7 @@
 -- |A module defining the type and operations of free k-vector spaces over a basis b (for a field k)
 module Math.Algebras.VectorSpace where
 
-import Prelude hiding ( (*>) )
+import Prelude hiding (  (<*), (*>) )
 
 import Control.Applicative hiding ( (<*), (*>) )
 import Control.Monad (ap)
diff --git a/Math/Combinatorics/Matroid.hs b/Math/Combinatorics/Matroid.hs
--- a/Math/Combinatorics/Matroid.hs
+++ b/Math/Combinatorics/Matroid.hs
@@ -7,14 +7,12 @@
 
 -- Source: Oxley, Matroid Theory (second edition)
 
-import Prelude hiding ( (*>) )
-
 import Math.Core.Utils
 import Math.Core.Field hiding (f7)
 
 import Math.Common.ListSet as LS -- set operations on strictly ascending lists
 -- import Math.Algebra.Field.Base hiding (Q, F2, F3, F5, F7, F11, f2, f3, f5, f7, f11)
-import Math.Algebra.LinearAlgebra hiding (rank, (*>))
+import Math.Algebra.LinearAlgebra hiding (rank)
 
 import qualified Math.Combinatorics.Graph as G -- hiding (combinationsOf, restriction, component, isConnected)
 import Math.Combinatorics.FiniteGeometry
diff --git a/Math/Combinatorics/StronglyRegularGraph.hs b/Math/Combinatorics/StronglyRegularGraph.hs
--- a/Math/Combinatorics/StronglyRegularGraph.hs
+++ b/Math/Combinatorics/StronglyRegularGraph.hs
@@ -9,8 +9,6 @@
 -- Strongly regular graphs are highly symmetric, and have large automorphism groups.
 module Math.Combinatorics.StronglyRegularGraph where
 
-import Prelude hiding ( (*>) )
-
 import qualified Data.List as L
 import Data.Maybe (isJust)
 import qualified Data.Map as M
diff --git a/Math/Projects/MiniquaternionGeometry.hs b/Math/Projects/MiniquaternionGeometry.hs
--- a/Math/Projects/MiniquaternionGeometry.hs
+++ b/Math/Projects/MiniquaternionGeometry.hs
@@ -2,7 +2,7 @@
 
 module Math.Projects.MiniquaternionGeometry where
 
-import Prelude hiding ( (*>) )
+import Prelude hiding (  (<*), (*>) )
 
 import qualified Data.List as L
 
diff --git a/Math/QuantumAlgebra/OrientedTangle.hs b/Math/QuantumAlgebra/OrientedTangle.hs
--- a/Math/QuantumAlgebra/OrientedTangle.hs
+++ b/Math/QuantumAlgebra/OrientedTangle.hs
@@ -5,7 +5,7 @@
 
 module Math.QuantumAlgebra.OrientedTangle where
 
-import Prelude hiding ( (*>), (<*>) )
+import Prelude hiding ( (*>) )
 
 import Math.Algebra.Field.Base
 import Math.Algebras.LaurentPoly -- hiding (lvar, q, q')
diff --git a/Math/QuantumAlgebra/Tangle.hs b/Math/QuantumAlgebra/Tangle.hs
--- a/Math/QuantumAlgebra/Tangle.hs
+++ b/Math/QuantumAlgebra/Tangle.hs
@@ -6,6 +6,8 @@
 -- (specifically, knot invariants).
 module Math.QuantumAlgebra.Tangle where
 
+import Prelude hiding ( (*>) )
+
 -- import qualified Data.List as L
 
 import Math.Algebras.VectorSpace