first-class-families

First-class type families

Modules

17 modules

Fcf71First-class type families For example, here is a regular type family: type family FromMaybe (a :: k) (m :: Maybe k) :: k
Fcf.Class.Bifunctor3Bifunctors. Bifunctors are "two-argument functors". This module is the type-level equivalent of Data.Bifunctor.
Fcf.Class.Foldable11Foldable types. A minimal implementation of this interface is given by either FoldMap or
Fcf.Class.Functor2
Fcf.Class.Monoid4Semigroups and monoids.
Fcf.Class.Monoid.Types2Carriers of useful monoid instances.
Fcf.Class.Ord6Equality and ordering. Note that equality doesn't really require a class,
Fcf.Classes2Overloaded functions.
Fcf.Combinators16General fcf combinators. See also Fcf.Data.Function for more.
Fcf.Core3The Eval family.
Fcf.Data.Bool4Booleans. Note that the operations from this module conflict with
Fcf.Data.Common11Common data types: tuples, Either, Maybe.
Fcf.Data.Function3Simple combinators for functions.
Fcf.Data.List39Lists. See also Fcf.Class.Foldable for additional functions.
Fcf.Data.Nat9Natural numbers. Note that the operators from this module conflict with GHC.TypeLits and
Fcf.Data.Symbol1Symbols Type-level strings. Note that the operators from this module conflict with GHC.TypeLits. Symbol also has instances of (<>) and ME…
Fcf.Utils13Miscellaneous families.

A library for type-level programming.

See README.

1 package