A | |
| A [Vector] | |
| A [Clarity_list] | |
| A2 [Vector] | |
| A2 [Clarity_list] | |
| A3 [Vector] | |
| A3 [Clarity_list] | |
| Align | Zip datatypes with non-uniform shapes using These.t |
| All [Monoid] | |
| Any [Monoid] | |
| Applicative | Applicative functors |
B | |
| Builder [Vector] | Efficient construction of vectors using mutable, one-by-one appending of elements |
C | |
| Clarity_list | List data type |
D | |
| Dual [Monoid] | |
E | |
| Either | Either.t represents value of two exclusive possibilities |
| Endo [Monoid] | |
F | |
| First [Semigroup] | |
| Fn | Various function combinators |
| Foldable | Foldable signatures |
| Functor | Functors |
I | |
| Id | Identity type |
| Int [Monoid] | |
L | |
| Last [Semigroup] | |
M | |
| M [Vector] | |
| M [Clarity_list] | |
| M2 [Vector] | |
| M2 [Clarity_list] | |
| M3 [Vector] | |
| M3 [Clarity_list] | |
| Make [Writer] | |
| Make [Validation] | |
| Make [Traversable] | |
| Make [These] | Monad instance requires Semigroup to combine Left values |
| Make [Monad] | |
| Make [Functor] | |
| Make [Foldable] | |
| Make [Applicative] | |
| Make [Align] | |
| Make2 [Traversable] | |
| Make2 [Monad] | |
| Make2 [Functor] | |
| Make2 [Applicative] | |
| Make2 [Align] | |
| Make3 [Traversable] | |
| Make3 [Monad] | |
| Make3 [Functor] | |
| Make3 [Applicative] | |
| Make3 [Align] | |
| Max [Monoid.Int] | |
| Min [Monoid.Int] | |
| Monad | Monads |
| Monoid | Monoids |
O | |
| Opt [Monoid] | |
| Option | Monad instance for an option type |
P | |
| Pair [Monoid] | |
| Product [Monoid.Int] | |
R | |
| Reader | Reader monad |
S | |
| Semigroup | Semigroups |
| State | State monad |
| Sum [Monoid.Int] | |
T | |
| These | Values of two non-exclusive variants |
| Traversable | Traversable signatures |
V | |
| Validation | A data-type like Either but with an error-accumulating Applicative |
| Vector | Efficient persistent vectors based on RRB-Trees |
| Void | Void.t is a logically uninhabited data type. |
W | |
| Writer | Writer monad |