diff --git a/Data/Functor/Representable/Trie.hs b/Data/Functor/Representable/Trie.hs
--- a/Data/Functor/Representable/Trie.hs
+++ b/Data/Functor/Representable/Trie.hs
@@ -19,18 +19,16 @@
   , mup, memo, memo2, memo3
   , inTrie, inTrie2, inTrie3
   -- * Workarounds for current GHC limitations
-  , (:=)(..)
   , trie, untrie
   , coerceKey, uncoerceKey
   ) where
 
 import Control.Monad.Representable
+import Data.Eq.Type
 import Data.Functor.Identity
 import Data.Functor.Product
 import Data.Key
 import Prelude hiding (lookup)
-
-data a := b where Refl :: a := a
 
 -- class (TraversableWithKey1 (Trie a), Representable (Trie a), Key (Trie a) ~ a) => HasTrie a where
 class (TraversableWithKey1 (Trie a), Representable (Trie a)) => HasTrie a where
diff --git a/representable-tries.cabal b/representable-tries.cabal
--- a/representable-tries.cabal
+++ b/representable-tries.cabal
@@ -1,6 +1,6 @@
 name:          representable-tries
 category:      Data Structures, Functors, Monads, Comonads
-version:       0.2.1
+version:       0.2.2
 license:       BSD3
 cabal-version: >= 1.6
 license-file:  LICENSE
@@ -27,6 +27,7 @@
     containers >= 0.4 && < 0.5,
     contravariant >= 0.1.2 && < 0.2,
     distributive >= 0.1.1 && < 0.2,
+    eq >= 0.2 && < 0.3,
     keys >= 0.2.1 && < 0.3,
     mtl >= 2.0.1.0 && < 2.1,
     representable-functors >= 0.3 && < 0.4,