module Polysemy.Check.Arbitrary.Generic where

import Control.Applicative (liftA2)
import Data.Kind (Type)
import GHC.Exts (type (~~))
import Generics.Kind hiding (SubstRep)
import Generics.Kind.Unexported
import Polysemy
import Polysemy.Check.Arbitrary.AnyEff
import Polysemy.Internal (send)
import Test.QuickCheck


------------------------------------------------------------------------------
-- | Data family for the instantiation of existential variables. If you want to
-- check properties for an effect @e@ that contains an existential type, the
-- synthesized 'Arbitrary' instance will instantiate all of @e@'s existential
-- types at @'ExistentialFor' e@.
--
-- @'ExistentialFor' e@ must have instances for every dictionary required by
-- @e@, and will likely require an 'Arbitrary' instance.
data family ExistentialFor (e :: Effect)


------------------------------------------------------------------------------
-- | Given @'GArbitraryK' a ('RepK' e) r a@, this typeclass computes
-- generators for every well-typed constructor of @e (Sem r) a@. It is capable
-- of building generators for GADTs.
class GArbitraryK (e :: Effect) (f :: LoT Effect -> Type) (r :: EffectRow) (a :: Type)  where
  garbitraryk :: [Gen (f (LoT2 (Sem r) a))]

instance GArbitraryK e U1 r a where
  garbitraryk :: [Gen (U1 (LoT2 (Sem r) a))]
garbitraryk = Gen (U1 (LoT2 (Sem r) a)) -> [Gen (U1 (LoT2 (Sem r) a))]
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Gen (U1 (LoT2 (Sem r) a)) -> [Gen (U1 (LoT2 (Sem r) a))])
-> Gen (U1 (LoT2 (Sem r) a)) -> [Gen (U1 (LoT2 (Sem r) a))]
forall a b. (a -> b) -> a -> b
$ U1 (LoT2 (Sem r) a) -> Gen (U1 (LoT2 (Sem r) a))
forall (f :: * -> *) a. Applicative f => a -> f a
pure U1 (LoT2 (Sem r) a)
forall k (p :: k). U1 p
U1

instance (GArbitraryK e f r a, GArbitraryK e g r a) => GArbitraryK e (f :*: g) r a where
  garbitraryk :: [Gen ((:*:) f g (LoT2 (Sem r) a))]
garbitraryk = (Gen (f (LoT2 (Sem r) a))
 -> Gen (g (LoT2 (Sem r) a)) -> Gen ((:*:) f g (LoT2 (Sem r) a)))
-> [Gen (f (LoT2 (Sem r) a))]
-> [Gen (g (LoT2 (Sem r) a))]
-> [Gen ((:*:) f g (LoT2 (Sem r) a))]
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 ((f (LoT2 (Sem r) a)
 -> g (LoT2 (Sem r) a) -> (:*:) f g (LoT2 (Sem r) a))
-> Gen (f (LoT2 (Sem r) a))
-> Gen (g (LoT2 (Sem r) a))
-> Gen ((:*:) f g (LoT2 (Sem r) a))
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 f (LoT2 (Sem r) a)
-> g (LoT2 (Sem r) a) -> (:*:) f g (LoT2 (Sem r) a)
forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
(:*:)) (forall (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e) (forall (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e)

instance GArbitraryKTerm (Interpret f (LoT2 (Sem r) a)) => GArbitraryK e (Field f) r a where
  garbitraryk :: [Gen (Field f (LoT2 (Sem r) a))]
garbitraryk = Gen (Field f (LoT2 (Sem r) a)) -> [Gen (Field f (LoT2 (Sem r) a))]
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Gen (Field f (LoT2 (Sem r) a))
 -> [Gen (Field f (LoT2 (Sem r) a))])
-> Gen (Field f (LoT2 (Sem r) a))
-> [Gen (Field f (LoT2 (Sem r) a))]
forall a b. (a -> b) -> a -> b
$ (Interpret f (LoT2 (Sem r) a) -> Field f (LoT2 (Sem r) a))
-> Gen (Interpret f (LoT2 (Sem r) a))
-> Gen (Field f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Interpret f (LoT2 (Sem r) a) -> Field f (LoT2 (Sem r) a)
forall d (t :: Atom d *) (x :: LoT d). Interpret t x -> Field t x
Field (Gen (Interpret f (LoT2 (Sem r) a))
 -> Gen (Field f (LoT2 (Sem r) a)))
-> Gen (Interpret f (LoT2 (Sem r) a))
-> Gen (Field f (LoT2 (Sem r) a))
forall a b. (a -> b) -> a -> b
$ GArbitraryKTerm (Interpret f (LoT2 (Sem r) a)) =>
Gen (Interpret f (LoT2 (Sem r) a))
forall t. GArbitraryKTerm t => Gen t
garbitrarykterm @(Interpret f (LoT2 (Sem r) a))

instance
    ( GArbitraryK e (SubstRep f (ExistentialFor e)) r a
    , SubstRep' f (ExistentialFor e) (LoT2 (Sem r) a)
    ) => GArbitraryK e (Exists Type f) r a where
  garbitraryk :: [Gen (Exists * f (LoT2 (Sem r) a))]
garbitraryk = (SubstRep f (ExistentialFor e) (LoT2 (Sem r) a)
 -> Exists * f (LoT2 (Sem r) a))
-> Gen (SubstRep f (ExistentialFor e) (LoT2 (Sem r) a))
-> Gen (Exists * f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (f (ExistentialFor e ':&&: LoT2 (Sem r) a)
-> Exists * f (LoT2 (Sem r) a)
forall k (t :: k) d (f :: LoT (k -> d) -> *) (x :: LoT d).
f (t ':&&: x) -> Exists k f x
Exists (f (ExistentialFor e ':&&: LoT2 (Sem r) a)
 -> Exists * f (LoT2 (Sem r) a))
-> (SubstRep f (ExistentialFor e) (LoT2 (Sem r) a)
    -> f (ExistentialFor e ':&&: LoT2 (Sem r) a))
-> SubstRep f (ExistentialFor e) (LoT2 (Sem r) a)
-> Exists * f (LoT2 (Sem r) a)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall t k (f :: LoT (t -> k) -> *) (x :: t) (xs :: LoT k).
SubstRep' f x xs =>
SubstRep f x xs -> f (x ':&&: xs)
forall (xs :: LoT Effect).
SubstRep' f (ExistentialFor e) xs =>
SubstRep f (ExistentialFor e) xs -> f (ExistentialFor e ':&&: xs)
unsubstRep @_ @_ @_ @(ExistentialFor e)) (Gen (SubstRep f (ExistentialFor e) (LoT2 (Sem r) a))
 -> Gen (Exists * f (LoT2 (Sem r) a)))
-> [Gen (SubstRep f (ExistentialFor e) (LoT2 (Sem r) a))]
-> [Gen (Exists * f (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$>
    GArbitraryK e (SubstRep f (ExistentialFor e)) r a =>
[Gen (SubstRep f (ExistentialFor e) (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @(SubstRep f (ExistentialFor e)) @r @a

instance (GArbitraryK e f r a, GArbitraryK e g r a) => GArbitraryK e (f :+: g) r a where
  garbitraryk :: [Gen ((:+:) f g (LoT2 (Sem r) a))]
garbitraryk = (Gen (f (LoT2 (Sem r) a)) -> Gen ((:+:) f g (LoT2 (Sem r) a)))
-> [Gen (f (LoT2 (Sem r) a))] -> [Gen ((:+:) f g (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap ((f (LoT2 (Sem r) a) -> (:+:) f g (LoT2 (Sem r) a))
-> Gen (f (LoT2 (Sem r) a)) -> Gen ((:+:) f g (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap f (LoT2 (Sem r) a) -> (:+:) f g (LoT2 (Sem r) a)
forall k (f :: k -> *) (g :: k -> *) (p :: k). f p -> (:+:) f g p
L1) (forall (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @f)
             [Gen ((:+:) f g (LoT2 (Sem r) a))]
-> [Gen ((:+:) f g (LoT2 (Sem r) a))]
-> [Gen ((:+:) f g (LoT2 (Sem r) a))]
forall a. Semigroup a => a -> a -> a
<> (Gen (g (LoT2 (Sem r) a)) -> Gen ((:+:) f g (LoT2 (Sem r) a)))
-> [Gen (g (LoT2 (Sem r) a))] -> [Gen ((:+:) f g (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap ((g (LoT2 (Sem r) a) -> (:+:) f g (LoT2 (Sem r) a))
-> Gen (g (LoT2 (Sem r) a)) -> Gen ((:+:) f g (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap g (LoT2 (Sem r) a) -> (:+:) f g (LoT2 (Sem r) a)
forall k (f :: k -> *) (g :: k -> *) (p :: k). g p -> (:+:) f g p
R1) (forall (r :: EffectRow) a.
GArbitraryK e g r a =>
[Gen (g (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @g)

instance (Interpret c (LoT2 (Sem r) a), GArbitraryK e f r a) => GArbitraryK e (c :=>: f) r a where
  garbitraryk :: [Gen ((:=>:) c f (LoT2 (Sem r) a))]
garbitraryk = (Gen (f (LoT2 (Sem r) a)) -> Gen ((:=>:) c f (LoT2 (Sem r) a)))
-> [Gen (f (LoT2 (Sem r) a))]
-> [Gen ((:=>:) c f (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap ((f (LoT2 (Sem r) a) -> (:=>:) c f (LoT2 (Sem r) a))
-> Gen (f (LoT2 (Sem r) a)) -> Gen ((:=>:) c f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap f (LoT2 (Sem r) a) -> (:=>:) c f (LoT2 (Sem r) a)
forall d (c :: Atom d Constraint) (x :: LoT d) (f :: LoT d -> *).
Interpret c x =>
f x -> (:=>:) c f x
SuchThat) (forall (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @f)

instance {-# OVERLAPPING #-} GArbitraryK e (c1 :=>: (c2 :=>: f)) r a
    => GArbitraryK e ((c1 ':&: c2) :=>: f) r a where
  garbitraryk :: [Gen ((:=>:) (c1 ':&: c2) f (LoT2 (Sem r) a))]
garbitraryk =
    ((:=>:) c1 (c2 :=>: f) (LoT2 (Sem r) a)
 -> (:=>:) (c1 ':&: c2) f (LoT2 (Sem r) a))
-> Gen ((:=>:) c1 (c2 :=>: f) (LoT2 (Sem r) a))
-> Gen ((:=>:) (c1 ':&: c2) f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap
      ((\(SuchThat (SuchThat x :: f x
x)) -> f x -> (:=>:) (c1 ':&: c2) f x
forall d (c :: Atom d Constraint) (x :: LoT d) (f :: LoT d -> *).
Interpret c x =>
f x -> (:=>:) c f x
SuchThat f x
x)
            :: (c1 :=>: (c2 :=>: f)) x -> ((c1 ':&: c2) :=>: f) x)
        (Gen ((:=>:) c1 (c2 :=>: f) (LoT2 (Sem r) a))
 -> Gen ((:=>:) (c1 ':&: c2) f (LoT2 (Sem r) a)))
-> [Gen ((:=>:) c1 (c2 :=>: f) (LoT2 (Sem r) a))]
-> [Gen ((:=>:) (c1 ':&: c2) f (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e

instance {-# OVERLAPPING #-} GArbitraryK e f r a => GArbitraryK e ('Kon ((~~) a) ':@: Var1 :=>: f) r a where
  garbitraryk :: [Gen ((:=>:) ('Kon ((~~) a) ':@: Var1) f (LoT2 (Sem r) a))]
garbitraryk = (f (LoT2 (Sem r) a)
 -> (:=>:) ('Kon ((~~) a) ':@: Var1) f (LoT2 (Sem r) a))
-> Gen (f (LoT2 (Sem r) a))
-> Gen ((:=>:) ('Kon ((~~) a) ':@: Var1) f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap f (LoT2 (Sem r) a)
-> (:=>:) ('Kon ((~~) a) ':@: Var1) f (LoT2 (Sem r) a)
forall d (c :: Atom d Constraint) (x :: LoT d) (f :: LoT d -> *).
Interpret c x =>
f x -> (:=>:) c f x
SuchThat (Gen (f (LoT2 (Sem r) a))
 -> Gen ((:=>:) ('Kon ((~~) a) ':@: Var1) f (LoT2 (Sem r) a)))
-> [Gen (f (LoT2 (Sem r) a))]
-> [Gen ((:=>:) ('Kon ((~~) a) ':@: Var1) f (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @f

instance {-# OVERLAPPING #-} GArbitraryK e f r a => GArbitraryK e ('Kon (~~) ':@: Var1 ':@: 'Kon a :=>: f) r a where
  garbitraryk :: [Gen
   ((:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon a) f (LoT2 (Sem r) a))]
garbitraryk = (f (LoT2 (Sem r) a)
 -> (:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon a) f (LoT2 (Sem r) a))
-> Gen (f (LoT2 (Sem r) a))
-> Gen
     ((:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon a) f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap f (LoT2 (Sem r) a)
-> (:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon a) f (LoT2 (Sem r) a)
forall d (c :: Atom d Constraint) (x :: LoT d) (f :: LoT d -> *).
Interpret c x =>
f x -> (:=>:) c f x
SuchThat (Gen (f (LoT2 (Sem r) a))
 -> Gen
      ((:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon a) f (LoT2 (Sem r) a)))
-> [Gen (f (LoT2 (Sem r) a))]
-> [Gen
      ((:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon a) f (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @f

instance {-# INCOHERENT #-} GArbitraryK e ('Kon ((~~) b) ':@: Var1 :=>: f) r a where
  garbitraryk :: [Gen ((:=>:) ('Kon ((~~) b) ':@: Var1) f (LoT2 (Sem r) a))]
garbitraryk = []

instance {-# INCOHERENT #-} GArbitraryK e ('Kon (~~) ':@: Var1 ':@: 'Kon b :=>: f) r a where
  garbitraryk :: [Gen
   ((:=>:) (('Kon (~~) ':@: Var1) ':@: 'Kon b) f (LoT2 (Sem r) a))]
garbitraryk = []

instance (GArbitraryK e f r a) => GArbitraryK e (M1 _1 _2 f) r a where
  garbitraryk :: [Gen (M1 _1 _2 f (LoT2 (Sem r) a))]
garbitraryk = (f (LoT2 (Sem r) a) -> M1 _1 _2 f (LoT2 (Sem r) a))
-> Gen (f (LoT2 (Sem r) a)) -> Gen (M1 _1 _2 f (LoT2 (Sem r) a))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap f (LoT2 (Sem r) a) -> M1 _1 _2 f (LoT2 (Sem r) a)
forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
M1 (Gen (f (LoT2 (Sem r) a)) -> Gen (M1 _1 _2 f (LoT2 (Sem r) a)))
-> [Gen (f (LoT2 (Sem r) a))]
-> [Gen (M1 _1 _2 f (LoT2 (Sem r) a))]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e


------------------------------------------------------------------------------
-- | @genEff \@e \@r \@a@ gets a generator capable of producing every
-- well-typed GADT constructor of @e (Sem r) a@.
genEff :: forall e r a. (GenericK e, GArbitraryK e (RepK e) r a) => Gen (e (Sem r) a)
genEff :: Gen (e (Sem r) a)
genEff = (RepK e (Sem r ':&&: (a ':&&: 'LoT0)) -> e (Sem r) a)
-> Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0))) -> Gen (e (Sem r) a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap RepK e (Sem r ':&&: (a ':&&: 'LoT0)) -> e (Sem r) a
forall k (f :: k) (x :: LoT k). GenericK f => RepK f x -> f :@@: x
toK (Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0))) -> Gen (e (Sem r) a))
-> Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0))) -> Gen (e (Sem r) a)
forall a b. (a -> b) -> a -> b
$ [Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0)))]
-> Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0)))
forall a. [Gen a] -> Gen a
oneof ([Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0)))]
 -> Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0))))
-> [Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0)))]
-> Gen (RepK e (Sem r ':&&: (a ':&&: 'LoT0)))
forall a b. (a -> b) -> a -> b
$ forall a.
GArbitraryK e (RepK e) r a =>
[Gen (RepK e (LoT2 (Sem r) a))]
forall (e :: Effect) (f :: LoT Effect -> *) (r :: EffectRow) a.
GArbitraryK e f r a =>
[Gen (f (LoT2 (Sem r) a))]
garbitraryk @e @(RepK e) @r



class GArbitraryKTerm (t :: Type) where
  garbitrarykterm :: Gen t

instance {-# OVERLAPPING #-} ArbitraryEffOfType a r r => GArbitraryKTerm (Sem r a) where
  garbitrarykterm :: Gen (Sem r a)
garbitrarykterm = do
    SomeEffOfType act :: e (Sem r) a
act <- [Gen (SomeEffOfType r a)] -> Gen (SomeEffOfType r a)
forall a. [Gen a] -> Gen a
oneof ([Gen (SomeEffOfType r a)] -> Gen (SomeEffOfType r a))
-> [Gen (SomeEffOfType r a)] -> Gen (SomeEffOfType r a)
forall a b. (a -> b) -> a -> b
$ ArbitraryEffOfType a r r => [Gen (SomeEffOfType r a)]
forall a (es :: EffectRow) (r :: EffectRow).
ArbitraryEffOfType a es r =>
[Gen (SomeEffOfType r a)]
genSomeEffOfType @a @r @r
    Sem r a -> Gen (Sem r a)
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Sem r a -> Gen (Sem r a)) -> Sem r a -> Gen (Sem r a)
forall a b. (a -> b) -> a -> b
$ e (Sem r) a -> Sem r a
forall (e :: Effect) (r :: EffectRow) a.
Member e r =>
e (Sem r) a -> Sem r a
send e (Sem r) a
act

instance {-# OVERLAPPING #-} (CoArbitrary a, GArbitraryKTerm b) => GArbitraryKTerm (a -> b) where
  garbitrarykterm :: Gen (a -> b)
garbitrarykterm = Gen b -> Gen (a -> b)
forall (f :: * -> *) a. Arbitrary1 f => Gen a -> Gen (f a)
liftArbitrary Gen b
forall t. GArbitraryKTerm t => Gen t
garbitrarykterm

instance Arbitrary a => GArbitraryKTerm a where
  garbitrarykterm :: Gen a
garbitrarykterm = Gen a
forall a. Arbitrary a => Gen a
arbitrary