-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Open type representations and dynamic types
--   
--   This package uses Data Types à la Carte to provide open type
--   representations and dynamic types/coercions for open type universes.
--   
--   Example 1 (dynamic types):
--   
--   <pre>
--   type MyUniverse = IntType :+: BoolType
--   
--   hlist :: [Dynamic MyUniverse]
--   hlist = [toDyn True, toDyn (1 :: Int)]
--   </pre>
--   
--   <pre>
--   *Main&gt; hlist
--   [True,1]
--   </pre>
--   
--   Note that if we were using <a>Data.Dynamic</a>, it would just print
--   
--   <pre>
--   [&lt;&lt;Bool&gt;&gt;,&lt;&lt;Int&gt;&gt;]
--   </pre>
--   
--   Example 2 (dynamically typed addition):
--   
--   <pre>
--   addDyn :: (TypeEq ts ts, PWitness Num ts ts) =&gt; Dynamic ts -&gt; Dynamic ts -&gt; Maybe (Dynamic ts)
--   addDyn (Dyn ta a) (Dyn tb b) = do
--       Dict &lt;- typeEq ta tb
--       Dict &lt;- pwit pNum ta
--       return (Dyn ta (a+b))
--   </pre>
--   
--   <a>Data.Dynamic</a> could only do this monomorphically, for one
--   <a>Num</a> type at a time.
@package open-typerep
@version 0.5


-- | Open type representations and dynamic types
module Data.TypeRep.Representation

-- | <a>Full</a>-indexed type representation
type TR = AST

-- | This class provides reification of type <tt>a</tt> in a universe
--   <tt>t</tt>. <tt><a>Typeable</a> t a</tt> means that <tt>a</tt> is in
--   the type universe represented by <tt>t</tt>.
class Typeable t a
typeRep' :: Typeable t a => TR t (Full a)

-- | Representation of type <tt>a</tt> in a type universe <tt>t</tt>
--   
--   This type can also be seen as a witness that <tt>a</tt> is a member of
--   <tt>t</tt> (i.e. <tt><a>Typeable</a> t a</tt>); see
--   <a>witTypeable</a>.
newtype TypeRep t a
TypeRep :: TR t (Full a) -> TypeRep t a
[unTypeRep] :: TypeRep t a -> TR t (Full a)

-- | Reification of type <tt>a</tt> in a type universe <tt>t</tt>
typeRep :: Typeable t a => TypeRep t a

-- | Equality on type representations
class Render t => TypeEq t u
typeEqSym :: TypeEq t u => (t sig1, Args (AST u) sig1) -> (t sig2, Args (AST u) sig2) -> Either String (Dict (DenResult sig1 ~ DenResult sig2))

-- | Equality on type representations
typeEqM :: (TypeEq t t, MonadError String m) => TypeRep t a -> TypeRep t b -> m (Dict (a ~ b))

-- | Equality on type representations
typeEq :: TypeEq t t => TypeRep t a -> TypeRep t b -> Maybe (Dict (a ~ b))

-- | Type constructor matching. This function makes it possible to match on
--   type representations without dealing with the underlying <a>AST</a>
--   representation.
--   
--   For example, to check that a <a>TypeRep</a> represents the type <tt>a
--   -&gt; Int</tt> for some <tt>a</tt>:
--   
--   <pre>
--   is_atoi :: (TypeEq t t, IntType :&lt;: t) =&gt; TypeRep t a -&gt; Bool
--   is_atoi t
--       | [E ta, E tb] &lt;- matchCon t
--       , Just _       &lt;- typeEq ta intType = True
--       | otherwise                         = False
--   </pre>
matchCon :: TypeRep t c -> [E (TypeRep t)]

-- | Monadic version of <a>matchCon</a>
--   
--   <pre>
--   matchConM = return . matchCon
--   </pre>
--   
--   <a>matchConM</a> is convenient when matching types in a monad, e.g.:
--   
--   <pre>
--   do ...
--      [E ta, E tb] &lt;- matchConM t
--      Dict         &lt;- typeEq ta tb
--      ...
--   </pre>
matchConM :: Monad m => TypeRep t c -> m [E (TypeRep t)]

-- | Witness a type constraint for a reified type
class Witness p t u
witSym :: Witness p t u => t sig -> Args (AST u) sig -> Dict (p (DenResult sig))

-- | Partially witness a type constraint for a reified type
class (ShowClass p, Render t) => PWitness p t u where pwitSym _ _ = throwError ""
pwitSym :: PWitness p t u => t sig -> Args (AST u) sig -> Either String (Dict (p (DenResult sig)))

-- | Default implementation of <a>pwitSym</a> for types that have a
--   <a>Witness</a> instance
pwitSymDefault :: Witness p t u => t sig -> Args (AST u) sig -> Either String (Dict (p (DenResult sig)))

-- | Witness a type constraint for a reified type
wit :: Witness p t t => Proxy p -> TypeRep t a -> Dict (p a)

-- | Partially witness a type constraint for a reified type
pwit :: (PWitness p t t, MonadError String m) => Proxy p -> TypeRep t a -> m (Dict (p a))

-- | Witness a <a>Typeable</a> constraint for a reified type
witTypeable :: Witness (Typeable t) t t => TypeRep t a -> Dict (Typeable t a)

-- | Partially witness a <a>Typeable</a> constraint for a reified type
pwitTypeable :: PWitness (Typeable t) t t => TypeRep t a -> Either String (Dict (Typeable t a))

-- | Safe cast (does not use <tt>unsafeCoerce</tt>)
cast :: (Typeable t a, Typeable t b, TypeEq t t) => Proxy t -> a -> Either String b

-- | Safe generalized cast (does not use <tt>unsafeCoerce</tt>)
gcast :: (Typeable t a, Typeable t b, TypeEq t t) => Proxy t -> c a -> Either String (c b)

-- | Dynamic type parameterized on a type universe
data Dynamic t
Dyn :: TypeRep t a -> a -> Dynamic t
toDyn :: Typeable t a => a -> Dynamic t
fromDyn :: (Typeable t a, TypeEq t t) => Dynamic t -> Either String a

-- | The universal class
class Any a

-- | Show the name of type classes
class ShowClass (p :: * -> Constraint)

-- | Show the name of a type class
showClass :: ShowClass p => Proxy p -> String

-- | Proxy of <a>Any</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pAny :: Proxy Any

-- | Proxy of <a>Typeable</a> class (from the base library). Can be passed
--   to <a>wit</a> and <a>pwit</a>.
pDataTypeable :: Proxy Typeable

-- | Proxy of <a>Eq</a> class. Can be passed to <a>wit</a> and <a>pwit</a>.
pEq :: Proxy Eq

-- | Proxy of <a>Ord</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pOrd :: Proxy Ord

-- | Proxy of <a>Show</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pShow :: Proxy Show

-- | Proxy of <a>Num</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pNum :: Proxy Num

-- | Proxy of <a>Integral</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pIntegral :: Proxy Integral
instance Language.Syntactic.Interpretation.Render t => GHC.Show.Show (Data.TypeRep.Representation.TypeRep t a)
instance Language.Syntactic.Sugar.Syntactic (Data.TypeRep.Representation.TypeRep t a)
instance (Data.TypeRep.Representation.TypeEq t1 t, Data.TypeRep.Representation.TypeEq t2 t) => Data.TypeRep.Representation.TypeEq (t1 Language.Syntactic.Syntax.:+: t2) t
instance Data.TypeRep.Representation.TypeEq Language.Syntactic.Syntax.Empty t
instance (Data.TypeRep.Representation.Witness p t1 t, Data.TypeRep.Representation.Witness p t2 t) => Data.TypeRep.Representation.Witness p (t1 Language.Syntactic.Syntax.:+: t2) t
instance Data.TypeRep.Representation.Witness p t t => Data.TypeRep.Representation.Witness p (Language.Syntactic.Syntax.AST t) t
instance (Data.TypeRep.Representation.PWitness p t1 t, Data.TypeRep.Representation.PWitness p t2 t) => Data.TypeRep.Representation.PWitness p (t1 Language.Syntactic.Syntax.:+: t2) t
instance (Data.TypeRep.Representation.TypeEq t t, Data.TypeRep.Representation.Witness GHC.Classes.Eq t t) => GHC.Classes.Eq (Data.TypeRep.Representation.Dynamic t)
instance Data.TypeRep.Representation.Witness GHC.Show.Show t t => GHC.Show.Show (Data.TypeRep.Representation.Dynamic t)
instance Data.TypeRep.Representation.Any a
instance Data.TypeRep.Representation.ShowClass Data.TypeRep.Representation.Any
instance Data.TypeRep.Representation.ShowClass Data.Typeable.Internal.Typeable
instance Data.TypeRep.Representation.ShowClass GHC.Classes.Eq
instance Data.TypeRep.Representation.ShowClass GHC.Classes.Ord
instance Data.TypeRep.Representation.ShowClass GHC.Show.Show
instance Data.TypeRep.Representation.ShowClass GHC.Num.Num
instance Data.TypeRep.Representation.ShowClass GHC.Real.Integral
instance Data.TypeRep.Representation.ShowClass (Data.TypeRep.Representation.Typeable t)

module Data.TypeRep.TH

-- | A version of <a>deriveRender</a> that applies <a>typeName</a> to each
--   constructor name. That is, e.g. the constructor <tt>Int_t :: IntType
--   (Full Int)</tt> will be rendered as "Int".
deriveRender_forType :: Name -> DecsQ

-- | Derive <a>TypeEq</a> instance for a type representation
deriveTypeEq :: Name -> DecsQ

-- | Derive <a>Witness</a> instance for a type representation
--   
--   <pre>
--   instance Witness Cl t t =&gt; Witness Cl Ty t where
--     witSym Con1 Nil = Dict
--     witSym Con2 (a :* b :* Nil) =
--         case wit (Proxy :: Proxy Cl) (TypeRep a) of
--           Dict -&gt; case wit (Proxy :: Proxy Cl) (TypeRep b) of
--             Dict -&gt; Dict
--   </pre>
deriveWitness :: Name -> Name -> DecsQ

-- | Derive <a>PWitness</a> instance for a type representation
--   
--   <pre>
--   instance PWitness Cl t t =&gt; PWitness Cl Ty t where
--     pwitSym Con1 Nil = return Dict
--     pwitSym Con2 (a :* b :* Nil) = do
--         Dict &lt;- pwit (Proxy :: Proxy Cl) (TypeRep a)
--         Dict &lt;- pwit (Proxy :: Proxy Cl) (TypeRep b)
--         return Dict
--   </pre>
derivePWitness :: Name -> Name -> DecsQ

-- | Derive <tt><a>Witness</a> <a>Any</a></tt> instance for a type
--   representation
--   
--   <pre>
--   instance Witness Any Ty t where
--     witSym _ _ = Dict
--     witSym _ _ = Dict
--   </pre>
deriveWitnessAny :: Name -> DecsQ

-- | Derive <tt><a>PWitness</a> <a>Any</a></tt> instance for a type
--   representation
--   
--   <pre>
--   instance PWitness Any Ty t where
--     pwitSym _ _ = return Dict
--     pwitSym _ _ = return Dict
--   </pre>
derivePWitnessAny :: Name -> DecsQ

-- | Derive <tt><a>Witness</a> (<a>Typeable</a> Ty)</tt> instance for a
--   type representation
--   
--   <pre>
--   instance (Ty :&lt;: t) =&gt; Witness (Typeable t) Ty t where
--     witSym Con1 Nil = Dict
--     witSym Con2 (a :* b :* Nil) =
--         case wit (Proxy :: Proxy (Typeable t)) (TypeRep a) of
--           Dict -&gt; case wit (Proxy :: Proxy (Typeable t)) (TypeRep b) of
--             Dict -&gt; Dict
--   </pre>
deriveWitnessTypeable :: Name -> DecsQ

-- | Derive <tt><a>PWitness</a> (<a>Typeable</a> Ty)</tt> instance for a
--   type representation
--   
--   <pre>
--   instance (Ty :&lt;: t) =&gt; PWitness (Typeable t) Ty t where
--     pwitSym Con1 Nil = return Dict
--     pwitSym Con2 (a :* b :* Nil) = do
--         Dict &lt;- pwit (Proxy :: Proxy (Typeable t)) (TypeRep a)
--         Dict &lt;- pwit (Proxy :: Proxy (Typeable t)) (TypeRep b)
--         return Dict
--   </pre>
derivePWitnessTypeable :: Name -> DecsQ


-- | Representations for signed and unsigned integer types
--   
--   The reason for using symbol names ending with <tt>_t</tt> is that
--   <tt>deriveRender</tt> uses everything that comes before <tt>_</tt>
--   when rendering the constructor.
module Data.TypeRep.Types.IntWord
data IntWordType a
Int8_t :: IntWordType (Full Int8)
Int16_t :: IntWordType (Full Int16)
Int32_t :: IntWordType (Full Int32)
Int64_t :: IntWordType (Full Int64)
Word8_t :: IntWordType (Full Word8)
Word16_t :: IntWordType (Full Word16)
Word32_t :: IntWordType (Full Word32)
Word64_t :: IntWordType (Full Word64)
int8Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Int8) => a
int16Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Int16) => a
int32Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Int32) => a
int64Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Int64) => a
word8Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Word8) => a
word16Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Word16) => a
word32Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Word32) => a
word64Type :: (Syntactic a, IntWordType :<: Domain a, Internal a ~ Word64) => a
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness GHC.Real.Integral Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness GHC.Num.Num Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.IntWord.IntWordType t
instance Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.IntWord.IntWordType t
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.IntWord.IntWordType


-- | Representations for specific types
--   
--   The reason for using symbol names ending with <tt>_t</tt> is that
--   <tt>deriveRender</tt> uses everything that comes before <tt>_</tt>
--   when rendering the constructor.
module Data.TypeRep.Types.Basic
data BoolType a
Bool_t :: BoolType (Full Bool)
data CharType a
Char_t :: CharType (Full Char)
data IntType a
Int_t :: IntType (Full Int)
data FloatType a
Float_t :: FloatType (Full Float)
data DoubleType a
Double_t :: DoubleType (Full Double)
data ListType a
List_t :: ListType (a :-> Full [a])
data FunType a
Fun_t :: FunType (a :-> (b :-> Full (a -> b)))
boolType :: (Syntactic a, BoolType :<: Domain a, Internal a ~ Bool) => a
charType :: (Syntactic a, CharType :<: Domain a, Internal a ~ Char) => a
intType :: (Syntactic a, IntType :<: Domain a, Internal a ~ Int) => a
floatType :: (Syntactic a, FloatType :<: Domain a, Internal a ~ Float) => a
doubleType :: (Syntactic a, DoubleType :<: Domain a, Internal a ~ Double) => a
listType :: (Syntactic list, Syntactic elem, Domain list ~ Domain elem, ListType :<: Domain list, Internal list ~ [Internal elem], elem ~ c e, list ~ c l) => elem -> list
funType :: (Syntactic fun, Syntactic a, Syntactic b, Domain fun ~ Domain a, Domain fun ~ Domain b, FunType :<: Domain fun, Internal fun ~ (Internal a -> Internal b), a ~ c x, b ~ c y, fun ~ c z) => a -> b -> fun
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.Witness GHC.Real.Integral Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.Witness GHC.Num.Num Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.Witness GHC.Num.Num Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.Witness GHC.Num.Num Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show t t => Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show t t => Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord t t => Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord t t => Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq t t => Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq t t => Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable t t => Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable t t => Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable t t => Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable t t => Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Basic.BoolType t
instance Data.TypeRep.Representation.TypeEq t t => Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.FunType t
instance Data.TypeRep.Representation.TypeEq t t => Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.ListType t
instance Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.DoubleType t
instance Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.FloatType t
instance Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.IntType t
instance Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.CharType t
instance Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Basic.BoolType t
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.DoubleType
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.ListType
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.FunType
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.FloatType
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.IntType
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.CharType
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Basic.BoolType


-- | <a>Typeable</a> instances for various types. The reason for having
--   these in a separate module is that it might be desired to have these
--   instances with other type representations.
--   
--   For example, instead of the instance
--   
--   <pre>
--   (BoolType :&lt;: t) =&gt; Typeable t Bool
--   </pre>
--   
--   one might want to have
--   
--   <pre>
--   Typeable MyTypeRep Bool
--   </pre>
module Data.TypeRep.Types.Basic.Typeable
instance (Data.TypeRep.Types.Basic.FunType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) t t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.FunType t
instance (Data.TypeRep.Types.Basic.ListType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) t t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.ListType t
instance (Data.TypeRep.Types.Basic.DoubleType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.DoubleType t
instance (Data.TypeRep.Types.Basic.FloatType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.FloatType t
instance (Data.TypeRep.Types.Basic.IntType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.IntType t
instance (Data.TypeRep.Types.Basic.CharType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.CharType t
instance (Data.TypeRep.Types.Basic.BoolType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.BoolType t
instance (Data.TypeRep.Types.Basic.FunType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) t t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.FunType t
instance (Data.TypeRep.Types.Basic.ListType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) t t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.ListType t
instance (Data.TypeRep.Types.Basic.DoubleType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.DoubleType t
instance (Data.TypeRep.Types.Basic.FloatType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.FloatType t
instance (Data.TypeRep.Types.Basic.IntType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.IntType t
instance (Data.TypeRep.Types.Basic.CharType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.CharType t
instance (Data.TypeRep.Types.Basic.BoolType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Basic.BoolType t
instance (Data.TypeRep.Types.Basic.BoolType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Types.Bool
instance (Data.TypeRep.Types.Basic.CharType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Types.Char
instance (Data.TypeRep.Types.Basic.IntType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Types.Int
instance (Data.TypeRep.Types.Basic.FloatType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Types.Float
instance (Data.TypeRep.Types.Basic.DoubleType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Types.Double
instance (Data.TypeRep.Types.Basic.ListType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a) => Data.TypeRep.Representation.Typeable t [a]
instance (Data.TypeRep.Types.Basic.FunType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b) => Data.TypeRep.Representation.Typeable t (a -> b)


-- | Representations for tuple types
--   
--   The reason for using symbol names ending with <tt>_t</tt> is that
--   <tt>deriveRender</tt> uses everything that comes before <tt>_</tt>
--   when rendering the constructor.
module Data.TypeRep.Types.Tuple
data TupleType a
Tup2_t :: TupleType (a :-> (b :-> Full (a, b)))
Tup3_t :: TupleType (a :-> (b :-> (c :-> Full (a, b, c))))
Tup4_t :: TupleType (a :-> (b :-> (c :-> (d :-> Full (a, b, c, d)))))
Tup5_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> Full (a, b, c, d, e))))))
Tup6_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> Full (a, b, c, d, e, f)))))))
Tup7_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> Full (a, b, c, d, e, f, g))))))))
Tup8_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> Full (a, b, c, d, e, f, g, h)))))))))
Tup9_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> Full (a, b, c, d, e, f, g, h, i))))))))))
Tup10_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> (j :-> Full (a, b, c, d, e, f, g, h, i, j)))))))))))
Tup11_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> (j :-> (k :-> Full (a, b, c, d, e, f, g, h, i, j, k))))))))))))
Tup12_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> (j :-> (k :-> (l :-> Full (a, b, c, d, e, f, g, h, i, j, k, l)))))))))))))
Tup13_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> (j :-> (k :-> (l :-> (m :-> Full (a, b, c, d, e, f, g, h, i, j, k, l, m))))))))))))))
Tup14_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> (j :-> (k :-> (l :-> (m :-> (n :-> Full (a, b, c, d, e, f, g, h, i, j, k, l, m, n)))))))))))))))
Tup15_t :: TupleType (a :-> (b :-> (c :-> (d :-> (e :-> (f :-> (g :-> (h :-> (i :-> (j :-> (k :-> (l :-> (m :-> (n :-> (o :-> Full (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o))))))))))))))))
tup2Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t (a, b)
tup3Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t (a, b, c)
tup4Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t (a, b, c, d)
tup5Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t (a, b, c, d, e)
tup6Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t (a, b, c, d, e, f)
tup7Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t (a, b, c, d, e, f, g)
tup8Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t (a, b, c, d, e, f, g, h)
tup9Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t (a, b, c, d, e, f, g, h, i)
tup10Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t j -> TypeRep t (a, b, c, d, e, f, g, h, i, j)
tup11Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t j -> TypeRep t k -> TypeRep t (a, b, c, d, e, f, g, h, i, j, k)
tup12Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t j -> TypeRep t k -> TypeRep t l -> TypeRep t (a, b, c, d, e, f, g, h, i, j, k, l)
tup13Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t j -> TypeRep t k -> TypeRep t l -> TypeRep t m -> TypeRep t (a, b, c, d, e, f, g, h, i, j, k, l, m)
tup14Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t j -> TypeRep t k -> TypeRep t l -> TypeRep t m -> TypeRep t n -> TypeRep t (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
tup15Type :: (TupleType :<: t) => TypeRep t a -> TypeRep t b -> TypeRep t c -> TypeRep t d -> TypeRep t e -> TypeRep t f -> TypeRep t g -> TypeRep t h -> TypeRep t i -> TypeRep t j -> TypeRep t k -> TypeRep t l -> TypeRep t m -> TypeRep t n -> TypeRep t o -> TypeRep t (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
tupWidth :: TupleType a -> Int
instance Data.TypeRep.Representation.PWitness GHC.Show.Show t t => Data.TypeRep.Representation.PWitness GHC.Show.Show Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.PWitness GHC.Num.Num Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.PWitness GHC.Real.Integral Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Ord t t => Data.TypeRep.Representation.PWitness GHC.Classes.Ord Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.PWitness GHC.Classes.Eq t t => Data.TypeRep.Representation.PWitness GHC.Classes.Eq Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable t t => Data.TypeRep.Representation.PWitness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.PWitness Data.TypeRep.Representation.Any Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.Witness GHC.Show.Show t t => Data.TypeRep.Representation.Witness GHC.Show.Show Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Ord t t => Data.TypeRep.Representation.Witness GHC.Classes.Ord Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.Witness GHC.Classes.Eq t t => Data.TypeRep.Representation.Witness GHC.Classes.Eq Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable t t => Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.Witness Data.TypeRep.Representation.Any Data.TypeRep.Types.Tuple.TupleType t
instance Data.TypeRep.Representation.TypeEq t t => Data.TypeRep.Representation.TypeEq Data.TypeRep.Types.Tuple.TupleType t
instance Language.Syntactic.Interpretation.Render Data.TypeRep.Types.Tuple.TupleType


-- | <a>Typeable</a> instances for tuple types. The reason for having these
--   in a separate module is that it might be desired to have these
--   instances with other type representations.
--   
--   For example, instead of the instance
--   
--   <pre>
--   (BoolType :&lt;: t) =&gt; Typeable t Bool
--   </pre>
--   
--   one might want to have
--   
--   <pre>
--   Typeable MyTypeRep Bool
--   </pre>
module Data.TypeRep.Types.Tuple.Typeable
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) t t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Tuple.TupleType t
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) t t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.Tuple.TupleType t
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b) => Data.TypeRep.Representation.Typeable t (a, b)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c) => Data.TypeRep.Representation.Typeable t (a, b, c)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d) => Data.TypeRep.Representation.Typeable t (a, b, c, d)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i, Data.TypeRep.Representation.Typeable t j) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i, j)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i, Data.TypeRep.Representation.Typeable t j, Data.TypeRep.Representation.Typeable t k) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i, j, k)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i, Data.TypeRep.Representation.Typeable t j, Data.TypeRep.Representation.Typeable t k, Data.TypeRep.Representation.Typeable t l) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i, j, k, l)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i, Data.TypeRep.Representation.Typeable t j, Data.TypeRep.Representation.Typeable t k, Data.TypeRep.Representation.Typeable t l, Data.TypeRep.Representation.Typeable t m) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i, j, k, l, m)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i, Data.TypeRep.Representation.Typeable t j, Data.TypeRep.Representation.Typeable t k, Data.TypeRep.Representation.Typeable t l, Data.TypeRep.Representation.Typeable t m, Data.TypeRep.Representation.Typeable t n) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
instance (Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t, Data.TypeRep.Representation.Typeable t a, Data.TypeRep.Representation.Typeable t b, Data.TypeRep.Representation.Typeable t c, Data.TypeRep.Representation.Typeable t d, Data.TypeRep.Representation.Typeable t e, Data.TypeRep.Representation.Typeable t f, Data.TypeRep.Representation.Typeable t g, Data.TypeRep.Representation.Typeable t h, Data.TypeRep.Representation.Typeable t i, Data.TypeRep.Representation.Typeable t j, Data.TypeRep.Representation.Typeable t k, Data.TypeRep.Representation.Typeable t l, Data.TypeRep.Representation.Typeable t m, Data.TypeRep.Representation.Typeable t n, Data.TypeRep.Representation.Typeable t o) => Data.TypeRep.Representation.Typeable t (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)


-- | <a>Typeable</a> instances for signed and unsigned integer types. The
--   reason for having these in a separate module is that it might be
--   desired to have these instances with other type representations.
--   
--   For example, instead of the instance
--   
--   <pre>
--   (IntWordType :&lt;: t) =&gt; Typeable t Int8
--   </pre>
--   
--   one might want to have
--   
--   <pre>
--   Typeable MyTypeRep Int8
--   </pre>
module Data.TypeRep.Types.IntWord.Typeable
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.PWitness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.IntWord.IntWordType t
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Witness (Data.TypeRep.Representation.Typeable t) Data.TypeRep.Types.IntWord.IntWordType t
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Int.Int8
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Int.Int16
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Int.Int32
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Int.Int64
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Word.Word8
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Word.Word16
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Word.Word32
instance (Data.TypeRep.Types.IntWord.IntWordType Language.Syntactic.Syntax.:<: t) => Data.TypeRep.Representation.Typeable t GHC.Word.Word64


-- | Open type representations and dynamic types
module Data.TypeRep

-- | This class provides reification of type <tt>a</tt> in a universe
--   <tt>t</tt>. <tt><a>Typeable</a> t a</tt> means that <tt>a</tt> is in
--   the type universe represented by <tt>t</tt>.
class Typeable t a

-- | Representation of type <tt>a</tt> in a type universe <tt>t</tt>
--   
--   This type can also be seen as a witness that <tt>a</tt> is a member of
--   <tt>t</tt> (i.e. <tt><a>Typeable</a> t a</tt>); see
--   <a>witTypeable</a>.
data TypeRep t a

-- | Reification of type <tt>a</tt> in a type universe <tt>t</tt>
typeRep :: Typeable t a => TypeRep t a

-- | Equality on type representations
class Render t => TypeEq t u

-- | Equality on type representations
typeEqM :: (TypeEq t t, MonadError String m) => TypeRep t a -> TypeRep t b -> m (Dict (a ~ b))

-- | Equality on type representations
typeEq :: TypeEq t t => TypeRep t a -> TypeRep t b -> Maybe (Dict (a ~ b))

-- | Type constructor matching. This function makes it possible to match on
--   type representations without dealing with the underlying <a>AST</a>
--   representation.
--   
--   For example, to check that a <a>TypeRep</a> represents the type <tt>a
--   -&gt; Int</tt> for some <tt>a</tt>:
--   
--   <pre>
--   is_atoi :: (TypeEq t t, IntType :&lt;: t) =&gt; TypeRep t a -&gt; Bool
--   is_atoi t
--       | [E ta, E tb] &lt;- matchCon t
--       , Just _       &lt;- typeEq ta intType = True
--       | otherwise                         = False
--   </pre>
matchCon :: TypeRep t c -> [E (TypeRep t)]

-- | Monadic version of <a>matchCon</a>
--   
--   <pre>
--   matchConM = return . matchCon
--   </pre>
--   
--   <a>matchConM</a> is convenient when matching types in a monad, e.g.:
--   
--   <pre>
--   do ...
--      [E ta, E tb] &lt;- matchConM t
--      Dict         &lt;- typeEq ta tb
--      ...
--   </pre>
matchConM :: Monad m => TypeRep t c -> m [E (TypeRep t)]

-- | Witness a type constraint for a reified type
class Witness p t u

-- | Partially witness a type constraint for a reified type
class (ShowClass p, Render t) => PWitness p t u where pwitSym _ _ = throwError ""

-- | Witness a type constraint for a reified type
wit :: Witness p t t => Proxy p -> TypeRep t a -> Dict (p a)

-- | Partially witness a type constraint for a reified type
pwit :: (PWitness p t t, MonadError String m) => Proxy p -> TypeRep t a -> m (Dict (p a))

-- | Witness a <a>Typeable</a> constraint for a reified type
witTypeable :: Witness (Typeable t) t t => TypeRep t a -> Dict (Typeable t a)

-- | Partially witness a <a>Typeable</a> constraint for a reified type
pwitTypeable :: PWitness (Typeable t) t t => TypeRep t a -> Either String (Dict (Typeable t a))

-- | Safe cast (does not use <tt>unsafeCoerce</tt>)
cast :: (Typeable t a, Typeable t b, TypeEq t t) => Proxy t -> a -> Either String b

-- | Safe generalized cast (does not use <tt>unsafeCoerce</tt>)
gcast :: (Typeable t a, Typeable t b, TypeEq t t) => Proxy t -> c a -> Either String (c b)

-- | Dynamic type parameterized on a type universe
data Dynamic t
Dyn :: TypeRep t a -> a -> Dynamic t
toDyn :: Typeable t a => a -> Dynamic t
fromDyn :: (Typeable t a, TypeEq t t) => Dynamic t -> Either String a

-- | The universal class
class Any a

-- | Show the name of type classes
class ShowClass (p :: * -> Constraint)

-- | Show the name of a type class
showClass :: ShowClass p => Proxy p -> String

-- | Proxy of <a>Any</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pAny :: Proxy Any

-- | Proxy of <a>Typeable</a> class (from the base library). Can be passed
--   to <a>wit</a> and <a>pwit</a>.
pDataTypeable :: Proxy Typeable

-- | Proxy of <a>Eq</a> class. Can be passed to <a>wit</a> and <a>pwit</a>.
pEq :: Proxy Eq

-- | Proxy of <a>Ord</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pOrd :: Proxy Ord

-- | Proxy of <a>Show</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pShow :: Proxy Show

-- | Proxy of <a>Num</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pNum :: Proxy Num

-- | Proxy of <a>Integral</a> class. Can be passed to <a>wit</a> and
--   <a>pwit</a>.
pIntegral :: Proxy Integral

-- | Sub-universe relation
--   
--   In general, a universe <tt>t</tt> is a sub-universe of <tt>u</tt> if
--   <tt>u</tt> has the form
--   
--   <pre>
--   t1 :+: t2 :+: ... :+: t
--   </pre>
class SubUniverse sub sup

-- | Cast a type representation to a larger universe
weakenUniverse :: SubUniverse sub sup => TypeRep sub a -> TypeRep sup a


-- | Utilities for polyvariadic functions
module Data.TypeRep.VarArg

-- | Newtype marking the result of a N-ary function
newtype Res a
Res :: a -> Res a

-- | Put a <a>Res</a> marker at the result type of a function
--   
--   <pre>
--   ToRes (a -&gt; b -&gt; ... -&gt; x) = a -&gt; b -&gt; ... -&gt; Res x
--   </pre>

-- | Remove the <a>Res</a> marker at the result type of a function
--   
--   <pre>
--   FromRes (a -&gt; b -&gt; ... -&gt; Res x) = a -&gt; b -&gt; ... -&gt; x
--   </pre>

-- | Witness of the arity of a function. <a>Arity</a> will normally be
--   indexed by <tt>(<a>ToRes</a> a)</tt>.
data Arity a
FunRes :: Arity (Res a)
FunArg :: Arity b -> Arity (a -> b)
class VarArg t
aritySym :: (VarArg t, VarArg u) => t sig -> Args (AST u) sig -> Arity (ToRes (DenResult sig))
fromResInvSym :: (VarArg t, VarArg u, a ~ DenResult sig) => t sig -> Args (AST u) sig -> Dict (FromRes (ToRes a) ~ a)

-- | Get the <a>Arity</a> of a type. The purpose is to be able to
--   distinguish between functions and non-functions without having to
--   handle all cases of a <a>TypeRep</a>.
arity :: VarArg t => TypeRep t a -> Arity (ToRes a)

-- | Prove that <a>FromRes</a> is the inverse of <a>ToRes</a>
fromResInv :: VarArg t => TypeRep t a -> Dict (FromRes (ToRes a) ~ a)
type NonFunction a = ToRes a ~ Res a

-- | Attempt to prove that a type is not a function type
nonFunction :: (VarArg t, MonadError String m) => TypeRep t a -> m (Dict (NonFunction a))

-- | Give a function a monadic result type. <tt>(<a>FunM</a> m)</tt> will
--   normally be indexed by <tt>(<a>ToRes</a> a)</tt>.
--   
--   <pre>
--   FunM m (a -&gt; b -&gt; ... -&gt; Res x) = a -&gt; b -&gt; ... -&gt; m x
--   </pre>

-- | Lift a function to a similar function with monadic result type
--   
--   <pre>
--   liftMonadic _ _ f = \a b ... x -&gt; return (f a b ... x)
--   </pre>
liftMonadic :: (VarArg t, Monad m) => Proxy m -> TypeRep t a -> a -> FunM m (ToRes a)

-- | Run the result of a monadic function
--   
--   <pre>
--   runMonadic run _ f = \a b ... x -&gt; run (f a b ... x)
--   </pre>
runMonadic :: VarArg t => (forall a. m a -> a) -> TypeRep t a -> FunM m (ToRes a) -> a

-- | Compose a function with an N-ary monadic function
--   
--   <pre>
--   compMonadic f _ g = \a b ... x -&gt; f (g a b ... x)
--   </pre>
compMonadic :: VarArg t => (forall a. m1 a -> m2 a) -> TypeRep t a -> FunM m1 (ToRes a) -> FunM m2 (ToRes a)

-- | Give a function monadic arguments and result type. <tt>(<a>FunM2</a>
--   m)</tt> will normally be indexed by <tt>(<a>ToRes</a> a)</tt>.
--   
--   <pre>
--   FunM m (a -&gt; b -&gt; ... -&gt; Res x) = m a -&gt; m b -&gt; ... -&gt; m x
--   </pre>

-- | Lift a function to a similar function with monadic arguments and
--   result
--   
--   <pre>
--   liftMonadic f = \ma mb ... mx -&gt; do
--       a &lt;- ma
--       b &lt;- mb
--       ...
--       x &lt;- mx
--       return (f a b ... x)
--   </pre>
liftMonadic2 :: (VarArg t, Monad m) => Proxy m -> TypeRep t a -> a -> FunM2 m (ToRes a)
instance (Data.TypeRep.VarArg.VarArg t1, Data.TypeRep.VarArg.VarArg t2) => Data.TypeRep.VarArg.VarArg (t1 Language.Syntactic.Syntax.:+: t2)
instance Data.TypeRep.VarArg.VarArg Data.TypeRep.Types.Basic.BoolType
instance Data.TypeRep.VarArg.VarArg Data.TypeRep.Types.Basic.CharType
instance Data.TypeRep.VarArg.VarArg Data.TypeRep.Types.Basic.IntType
instance Data.TypeRep.VarArg.VarArg Data.TypeRep.Types.Basic.FloatType
instance Data.TypeRep.VarArg.VarArg Data.TypeRep.Types.Basic.ListType
instance Data.TypeRep.VarArg.VarArg Data.TypeRep.Types.Basic.FunType


-- | Utilities for working with ASTs of the form <tt><a>AST</a> (sym
--   <a>:&amp;:</a> <a>TypeRep</a> t)</tt>
module Language.Syntactic.TypeRep
mkVarSym :: Witness Typeable t t => TypeRep t a -> Name -> BindingT (Full a)
mkLamSym :: Witness Typeable t t => TypeRep t a -> TypeRep t b -> Name -> BindingT (b :-> Full (a -> b))

-- | Inject a symbol in an <a>AST</a> with a domain decorated by a type
--   representation
injTR :: (sub :<: sup, Typeable t (DenResult sig)) => sub sig -> AST (sup :&: TypeRep t) sig

-- | Make a smart constructor of a symbol. <tt>smartSymT</tt> has any type
--   of the form:
--   
--   <pre>
--   smartSymTR :: (sub :&lt;: AST (sup :&amp;: TypeRep t), Typeable t x)
--       =&gt; sub (a :-&gt; b :-&gt; ... :-&gt; Full x)
--       -&gt; (ASTF sup a -&gt; ASTF sup b -&gt; ... -&gt; ASTF sup x)
--   </pre>
smartSymTR :: (Signature sig, supT ~ (sup :&: TypeRep t), f ~ SmartFun supT sig, sig ~ SmartSig f, supT ~ SmartSym f, sub :<: sup, Typeable t (DenResult sig)) => sub sig -> f

-- | "Sugared" symbol application
--   
--   <a>sugarSymTR</a> has any type of the form:
--   
--   <pre>
--   sugarSymTR ::
--       ( sub :&lt;: AST (sup :&amp;: TypeRep t)
--       , Syntactic a
--       , Syntactic b
--       , ...
--       , Syntactic x
--       , Domain a ~ Domain b ~ ... ~ Domain x
--       , Typeable t (Internal x)
--       ) =&gt; sub (Internal a :-&gt; Internal b :-&gt; ... :-&gt; Full (Internal x))
--         -&gt; (a -&gt; b -&gt; ... -&gt; x)
--   </pre>
sugarSymTR :: (Signature sig, supT ~ (sup :&: TypeRep t), fi ~ SmartFun supT sig, sig ~ SmartSig fi, supT ~ SmartSym fi, SyntacticN f fi, sub :<: sup, Typeable t (DenResult sig)) => sub sig -> f

-- | Default <a>CodeMotionInterface</a> for domains of the form <tt>((...
--   <a>:+:</a> <a>BindingT</a> <a>:+:</a> ... ) <a>:&amp;:</a>
--   <a>TypeRep</a> t)</tt>
defaultInterfaceTypeRep :: (BindingT :<: sym, Let :<: sym, symT ~ (sym :&: TypeRep t), FunType :<: t, TypeEq t t, Witness Typeable t t) => (forall a b. ASTF symT a -> ASTF symT b -> Bool) -> (forall a. ASTF symT a -> Bool) -> CodeMotionInterface symT


-- | <a>Syntactic</a> instance for functions
--   
--   This module is based on domains of the form <tt>((... <a>:+:</a>
--   <a>BindingT</a> <a>:+:</a> ... ) <a>:&amp;:</a> <a>TypeRep</a> t)</tt>
module Language.Syntactic.TypeRep.Sugar.BindingTR
instance (sym ~ (s Language.Syntactic.Decoration.:&: Data.TypeRep.Representation.TypeRep t), Language.Syntactic.Sugar.Syntactic a, Language.Syntactic.Sugar.Domain a ~ sym, Language.Syntactic.Sugar.Syntactic b, Language.Syntactic.Sugar.Domain b ~ sym, Language.Syntactic.Functional.BindingT Language.Syntactic.Syntax.:<: s, Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal a), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal b), Data.TypeRep.Representation.Witness Data.Typeable.Internal.Typeable t t, Data.TypeRep.Types.Basic.FunType Language.Syntactic.Syntax.:<: t) => Language.Syntactic.Sugar.Syntactic (a -> b)


-- | <a>Syntactic</a> instances for tuples and symbol domains decorated
--   with <a>TypeRep</a>
module Language.Syntactic.TypeRep.Sugar.TupleTR
instance (sym ~ (s Language.Syntactic.Decoration.:&: Data.TypeRep.Representation.TypeRep t), Language.Syntactic.Sugar.Syntactic a, Language.Syntactic.Sugar.Domain a ~ sym, Language.Syntactic.Sugar.Syntactic b, Language.Syntactic.Sugar.Domain b ~ sym, Language.Syntactic.Functional.Tuple.Tuple Language.Syntactic.Syntax.:<: s, Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal a), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal b), Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t) => Language.Syntactic.Sugar.Syntactic (a, b)
instance (sym ~ (s Language.Syntactic.Decoration.:&: Data.TypeRep.Representation.TypeRep t), Language.Syntactic.Sugar.Syntactic a, Language.Syntactic.Sugar.Domain a ~ sym, Language.Syntactic.Sugar.Syntactic b, Language.Syntactic.Sugar.Domain b ~ sym, Language.Syntactic.Sugar.Syntactic c, Language.Syntactic.Sugar.Domain c ~ sym, Language.Syntactic.Functional.Tuple.Tuple Language.Syntactic.Syntax.:<: s, Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal a), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal b), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal c), Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t) => Language.Syntactic.Sugar.Syntactic (a, b, c)
instance (sym ~ (s Language.Syntactic.Decoration.:&: Data.TypeRep.Representation.TypeRep t), Language.Syntactic.Sugar.Syntactic a, Language.Syntactic.Sugar.Domain a ~ sym, Language.Syntactic.Sugar.Syntactic b, Language.Syntactic.Sugar.Domain b ~ sym, Language.Syntactic.Sugar.Syntactic c, Language.Syntactic.Sugar.Domain c ~ sym, Language.Syntactic.Sugar.Syntactic d, Language.Syntactic.Sugar.Domain d ~ sym, Language.Syntactic.Functional.Tuple.Tuple Language.Syntactic.Syntax.:<: s, Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal a), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal b), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal c), Data.TypeRep.Representation.Typeable t (Language.Syntactic.Sugar.Internal d), Data.TypeRep.Types.Tuple.TupleType Language.Syntactic.Syntax.:<: t) => Language.Syntactic.Sugar.Syntactic (a, b, c, d)


-- | Construction and elimination of tuples
--   
--   Something similar can be achieved using the <a>Syntactic</a> instances
--   from <a>Language.Syntactic.TypeRep.Sugar.TupleTR</a>, e.g:
--   
--   <pre>
--   sel1' :: forall sym t a b
--       .  ( Typeable t a
--          , Typeable t b
--          , Tuple     :&lt;: sym
--          , TupleType :&lt;: t
--          )
--       =&gt; ASTF (sym :&amp;: TypeRep t) (a,b) -&gt; ASTF (sym :&amp;: TypeRep t) a
--   sel1' ab = a
--     where
--       (a, _ :: ASTF (sym :&amp;: TypeRep t) b) = sugar ab
--   </pre>
--   
--   But the point of this module is to do it without the <a>Typeable</a>
--   constraint.
module Language.Syntactic.TypeRep.TupleConversion
sel1 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel1 tup)
sel2 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel2 tup)
sel3 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel3 tup)
sel4 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel4 tup)
sel5 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel5 tup)
sel6 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel6 tup)
sel7 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel7 tup)
sel8 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel8 tup)
sel9 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel9 tup)
sel10 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel10 tup)
sel11 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel11 tup)
sel12 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel12 tup)
sel13 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel13 tup)
sel14 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel14 tup)
sel15 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) tup -> ASTF (sym :&: TypeRep t) (Sel15 tup)
tup2 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) (a, b)
tup3 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) (a, b, c)
tup4 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) (a, b, c, d)
tup5 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) (a, b, c, d, e)
tup6 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f)
tup7 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g)
tup8 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h)
tup9 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i)
tup10 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) j -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i, j)
tup11 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) j -> ASTF (sym :&: TypeRep t) k -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i, j, k)
tup12 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) j -> ASTF (sym :&: TypeRep t) k -> ASTF (sym :&: TypeRep t) l -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i, j, k, l)
tup13 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) j -> ASTF (sym :&: TypeRep t) k -> ASTF (sym :&: TypeRep t) l -> ASTF (sym :&: TypeRep t) m -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i, j, k, l, m)
tup14 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) j -> ASTF (sym :&: TypeRep t) k -> ASTF (sym :&: TypeRep t) l -> ASTF (sym :&: TypeRep t) m -> ASTF (sym :&: TypeRep t) n -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
tup15 :: (Tuple :<: sym, TupleType :<: t) => ASTF (sym :&: TypeRep t) a -> ASTF (sym :&: TypeRep t) b -> ASTF (sym :&: TypeRep t) c -> ASTF (sym :&: TypeRep t) d -> ASTF (sym :&: TypeRep t) e -> ASTF (sym :&: TypeRep t) f -> ASTF (sym :&: TypeRep t) g -> ASTF (sym :&: TypeRep t) h -> ASTF (sym :&: TypeRep t) i -> ASTF (sym :&: TypeRep t) j -> ASTF (sym :&: TypeRep t) k -> ASTF (sym :&: TypeRep t) l -> ASTF (sym :&: TypeRep t) m -> ASTF (sym :&: TypeRep t) n -> ASTF (sym :&: TypeRep t) o -> ASTF (sym :&: TypeRep t) (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)