module LinearScan.Yoneda where
import Debug.Trace (trace, traceShow)
import qualified Prelude
import qualified Data.IntMap
import qualified Data.IntSet
import qualified Data.List
import qualified Data.Ord
import qualified Data.Functor.Identity
import qualified LinearScan.Utils
import qualified LinearScan.Applicative as Applicative
import qualified LinearScan.Functor as Functor
import qualified LinearScan.Iso as Iso
import qualified LinearScan.Monad as Monad
#ifdef __GLASGOW_HASKELL__
import qualified GHC.Base as GHC.Base
import qualified GHC.Prim as GHC.Prim
#else
import qualified LinearScan.IOExts as IOExts
#endif
#ifdef __GLASGOW_HASKELL__
unsafeCoerce = GHC.Base.unsafeCoerce#
#else
unsafeCoerce = IOExts.unsafeCoerce
#endif
#ifdef __GLASGOW_HASKELL__
type Any = GHC.Prim.Any
#else
type Any = ()
#endif
__ :: any
__ = Prelude.error "Logical or arity value used"
type Yoneda f a = () -> (a -> Any) -> f
coq_Yoneda_lemma :: (Functor.Functor a1) -> Iso.Isomorphism (Yoneda a1 a2) a1
coq_Yoneda_lemma h =
Iso.Build_Isomorphism (\x -> unsafeCoerce x __ (\x0 -> x0)) (\x _ k ->
Functor.fmap h k x)
coq_Yoneda_Functor :: Functor.Functor (Yoneda a1 Any)
coq_Yoneda_Functor _ _ g k _ h =
k __ ((Prelude..) h g)
coq_Yoneda_Applicative :: (Applicative.Applicative a1) ->
Applicative.Applicative (Yoneda a1 Any)
coq_Yoneda_Applicative h =
Applicative.Build_Applicative coq_Yoneda_Functor (\_ x _ k ->
Applicative.pure h (k x)) (\_ _ g x _ k ->
Applicative.ap h (unsafeCoerce g __ ((Prelude..) k))
(Iso.iso_to (coq_Yoneda_lemma (Applicative.is_functor h)) x))
coq_Yoneda_join :: (Monad.Monad a1) -> (Yoneda a1 (Yoneda a1 a2)) -> (a2 ->
a3) -> a1
coq_Yoneda_join h k h0 =
Monad.join h (unsafeCoerce k __ (\y -> y __ h0))
coq_Yoneda_Monad :: (Monad.Monad a1) -> Monad.Monad (Yoneda a1 Any)
coq_Yoneda_Monad h =
Monad.Build_Monad (coq_Yoneda_Applicative (Monad.is_applicative h))
(unsafeCoerce (\_ x _ -> coq_Yoneda_join h x))