first-class-families

First-class type families

Modules

FcfFirst-class type families For example, here is a regular type family: type family FromMaybe (a :: k) (m :: Maybe k) :: k
Fcf.Class.BifunctorBifunctors. Bifunctors are "two-argument functors". This module is the type-level equivalent of Data.Bifunctor.
Fcf.Class.FoldableFoldable types. A minimal implementation of this interface is given by either FoldMap or
Fcf.Class.Functor
Fcf.Class.MonoidSemigroups and monoids.
Fcf.Class.Monoid.TypesCarriers of useful monoid instances.
Fcf.Class.OrdEquality and ordering. Note that equality doesn't really require a class,
Fcf.ClassesOverloaded functions.
Fcf.CombinatorsGeneral fcf combinators. See also Fcf.Data.Function for more.
Fcf.CoreThe Eval family.
Fcf.Data.BoolBooleans. Note that the operations from this module conflict with
Fcf.Data.CommonCommon data types: tuples, Either, Maybe.
Fcf.Data.FunctionSimple combinators for functions.
Fcf.Data.ListLists. See also Fcf.Class.Foldable for additional functions.
Fcf.Data.NatNatural numbers. Note that the operators from this module conflict with GHC.TypeLits and
Fcf.Data.SymbolSymbols Type-level strings. Note that the operators from this module conflict with GHC.TypeLits. Symbol also has instances of (<>) and ME…
Fcf.UtilsMiscellaneous families.

A library for type-level programming.

See README.

1 package