diff --git a/src/Data/Constraint/Trivial.hs b/src/Data/Constraint/Trivial.hs
--- a/src/Data/Constraint/Trivial.hs
+++ b/src/Data/Constraint/Trivial.hs
@@ -2,7 +2,7 @@
 -- Module      :  Data.Constraint.Trivial
 -- Copyright   :  (c) 2014-2016 Justus Sagemüller
 -- License     :  GPL v3 (see LICENSE)
--- Maintainer  :  (@) jsagemue $ uni-koeln.de
+-- Maintainer  :  (@) jsag $ hvl.no
 --
 {-# LANGUAGE ConstraintKinds         #-}
 {-# LANGUAGE DataKinds               #-}
@@ -12,6 +12,7 @@
 {-# LANGUAGE Rank2Types              #-}
 {-# LANGUAGE EmptyCase               #-}
 {-# LANGUAGE PolyKinds               #-}
+{-# LANGUAGE TypeInType              #-}
 {-# LANGUAGE TypeOperators           #-}
 {-# LANGUAGE UndecidableInstances    #-}
 {-# LANGUAGE UndecidableSuperClasses #-}
@@ -47,7 +48,7 @@
 --   you are guaranteed that it can under no circumstances actually be invoked, you
 --   are allowed to to anything whatsoever, even create a value of an uninhabited unlifted
 --   type.
-nope :: forall (a :: TYPE rep). Bottom => a
+nope :: forall rep (a :: TYPE rep). Bottom => a
 nope = case no of
 
 -- | A constraint that is always/unconditionally fulfilled. This behaves the same
diff --git a/trivial-constraint.cabal b/trivial-constraint.cabal
--- a/trivial-constraint.cabal
+++ b/trivial-constraint.cabal
@@ -2,7 +2,7 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                trivial-constraint
-version:             0.6.0.0
+version:             0.7.0.0
 synopsis:            Constraints that any type, resp. no type fulfills
 description:         Since GHC 7.4, constraints are first-class: we have the constraint 
                      kind, and thus type-classes have a kind of form @k -> Constraint@,