diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,3 +1,12 @@
+1.2.1.2
+---
+* exported the `/` type operator with `ExplicitNamespaces` enabled to
+  support GHC 8. Should be backwards compatible through GHC 7.6.
+
+1.2.1.1
+---
+* added a basic test suite with doctests
+
 1.2.1.0
 ---
 * changed `Integral` implementation: `quotRem` now uses modular inversion!
diff --git a/modular-arithmetic.cabal b/modular-arithmetic.cabal
--- a/modular-arithmetic.cabal
+++ b/modular-arithmetic.cabal
@@ -1,5 +1,5 @@
 name:                modular-arithmetic
-version:             1.2.1.1
+version:             1.2.1.2
 synopsis:            A type for integers modulo some constant.
 
 description:         A convenient type for working with integers modulo some constant. It saves you from manually wrapping numeric operations all over the place and prevents a range of simple mistakes. @Integer `Mod` 7@ is the type of integers (mod 7) backed by @Integer@.
@@ -26,12 +26,12 @@
   hs-source-dirs:      src
   ghc-options:         -Wall
   exposed-modules:     Data.Modular
-  build-depends:       base >=4.7 && <5
+  build-depends:       base >= 4.7 && < 5
 
 test-suite examples
   hs-source-dirs:      test-suite
   main-is:             DocTest.hs
   type:                exitcode-stdio-1.0
-  build-depends:       base
-                     , Glob    ==0.7.*
-                     , doctest ==0.9.*
+  build-depends:       base >= 4.7 && < 5
+                     , Glob >= 0.7 && < 0.8
+                     , doctest >= 0.9 && < 0.12
diff --git a/src/Data/Modular.hs b/src/Data/Modular.hs
--- a/src/Data/Modular.hs
+++ b/src/Data/Modular.hs
@@ -3,8 +3,10 @@
 {-# LANGUAGE ScopedTypeVariables #-}
 {-# LANGUAGE TypeOperators       #-}
 {-# LANGUAGE GADTs               #-}
-{-# LANGUAGE TypeFamilies #-}
+{-# LANGUAGE TypeFamilies        #-}
 
+{-# LANGUAGE ExplicitNamespaces  #-}
+
 -- |
 -- Types for working with integers modulo some constant.
 module Data.Modular (
@@ -16,7 +18,7 @@
   -- * Modular arithmetic
   Mod,
   unMod, toMod, toMod',
-  inv, (/)(), ℤ,
+  inv, type (/)(), ℤ,
   modVal, SomeMod, someModVal
 ) where
 
@@ -154,7 +156,7 @@
 --
 -- Note that only numbers coprime to @n@ have an inverse modulo @n@:
 --
--- >>> inv 6 :: ℤ/15
+-- > inv 6 :: ℤ/15
 -- *** Exception: divide by 6 (mod 15), non-coprime to modulus
 --
 inv :: forall n i. (KnownNat n, Integral i) => Mod i n -> Mod i n