Formalizations that are listed as Haskell structures are a formalization of that structure in the category Set reflecting the way it is encoded in Haskell.
An isomorphism or implication between structures listed here just indicates that there are cases where these implications hold, but they are not necessarily generally true.
Legend:
- A ≅ B -- Proof that A isomorphic to B.
- A ⇒ B -- Proof that A implies an instance of B. Can be interpreted as A is a subset of B.
Index:
- Atkey's Parameterized Monad ⇒ Lax 2-Functor
- Atkey's Parameterized Monad ≅ Haskell Indexed Monad
- Functor ≅ Haskell Functor
- Functor ⇒ Lax 2-Functor
- Graded Lax Monoidal Functor ≅ Haskell Graded Applicative
- Graded Monad ≅ Haskell Graded Monad
- Graded Monad ≅ Lax 2-Functor
- Indexed Lax Monoidal Functor ≅ Haskell Indexed Applicative
- Indexed Lax Monoidal Functor ≅ Graded Lax Monoidal Functor
- Indexed Monad ≅ Haskell Indexed Monad
- Indexed Monad ≅ Lax 2-Functor
- Indexed Monad ≅ Graded Monad
- Lax Monoidal Functor ≅ Graded Lax Monoidal Functor
- Lax Monoidal Functor ≅ Indexed Lax Monoidal Functor
- Lax Monoidal Functor ≅ Graded Monad
- Lax Monoidal Functor ≅ Monad
- Lax Monoidal Functor ≅ Haskell Applicative
- Lax Monoidal Functor ≅ Haskell Graded Applicative
- Lax Monoidal Functor ≅ Haskell Graded Monad
- Lax Monoidal Functor ≅ Lax 2-Functor
- Monad ≅ Haskell Monad
- Monad ≅ Lax 2-Functor