Package0.8.2Other
fcf-containers
Data structures and algorithms for first-class-families
- Version0.8.2
- CategoryOther
- LicenceBSD-3-Clause
- Authorgspia
- Maintaineriahogsp@gmail.com
- Homepagegithub.com/gspia/fcf-containers
- Pinned byhackage fcf-containers 0.8.2
- Sourcehackage.haskell.org/package/fcf-containers-0.8.2
Modules
22 modules- Fcf.Alg.List20Fcf.Alg.List Type-level ListF to be used with Cata, Ana and Hylo. This module also contains other list-related functions (that might move to
- Fcf.Alg.Morphism20Fcf.Alg.Morphism Type-level Cata and Ana can be used to do complex computation that live only
- Fcf.Alg.Nat2Fcf.Data.Nat
- Fcf.Alg.Other2Fcf.Alg.Other To be moved to some other place
- Fcf.Alg.Sort10Fcf.Alg.Sort
- Fcf.Alg.Symbol13Fcf.Alg.Symbol Type-level symbols and functions for them. Note that the operators from this module conflict with GHC.TypeLits. TODO: Woul…
- Fcf.Alg.Tree16Fcf.Alg.Tree Type-level TreeF and BTreeF to be used with Cata, Ana and Hylo. This also
- Fcf.Control.Monad27Fcf.Control.Monad
- Fcf.Data.Bitree10Fcf.Data.Bitree Binary trees
- Fcf.Data.Char11Fcf.Data.Char
- Fcf.Data.List.Utils2Fcf.Data.List.Utils Some of the following methods would probably have better place at the
- Fcf.Data.MapC27Fcf.Data.MapC MapC provides an interface to mapping keys to values, which is similar to
- Fcf.Data.NatMap27Fcf.Data.NatMap NatMap provides an interface to mapping keys (Nat's) to values, which is
- Fcf.Data.NewText63Fcf.Data.NewText We mimick Data.Text but on type level. The current internal representation
- Fcf.Data.OldText47Fcf.Data.OldText We mimick Data.Text but on type level. The internal representation is based on
- Fcf.Data.Reflect2Fcf.Data.Reflect Helpers to get results from type-level computations into the fromType-level.
- Fcf.Data.Set17Fcf.Data.Set Set provides an interface which is similar to the that given by the
- Fcf.Data.Symbol12Fcf.Data.Symbol This might should go to first-class-families.
- Fcf.Data.Text47Fcf.Data.Text We mimick Data.Text but on type level. The current internal representation is based
- Fcf.Data.Tree15Fcf.Data.Tree Tree provides an interface which is similar to the that given by the
- Fcf.Data.Tuple5Fcf.Data.Tuple
Internal modules · 1
- Fcf.Data.Text.Internal14Fcf.Data.Text.Internal This is from https://kcsongor.github.io/symbol-parsing-haskell/ Please do also check the symbols library at Hackage.
Description
Package fcf-containers provides type-level functions and data structures that operate on type-level computations. Specifically, we mimick the contents of containers-package and show how these can be used. Everything is based on the ideas given in the first-class-families -package.
Depends on
5 packages- base-4.20.2.0with GHC
- containers-0.7with GHC
- first-class-families-0.8.1.0in this set
- ghc-prim-0.12.0with GHC
- text-2.1.3with GHC
Used by in this set · 0
Nothing in this set depends on it.