free-functors alternatives and similar packages
Based on the "Data" category.
Alternatively, view free-functors alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
lens
Lenses, Folds, and Traversals - Join us on freenode #haskell-lens -
-
text
Haskell library for space- and time-efficient operations over Unicode text. -
code-builder
Packages for defining APIs, running them, generating client code and documentation. -
cassava
A CSV parsing and encoding library optimized for ease of use and high performance -
unordered-containers
Efficient hashing-based container types -
compendium-client
Mu (μ) is a purely functional framework for building micro services. -
holmes
A reference library for constraint-solving with propagators and CDCL. -
binary
Efficient, pure binary serialisation using ByteStrings in Haskell. -
-
-
-
-
primitive
This package provides various primitive memory-related operations. -
resource-pool
A high-performance striped resource pooling implementation for Haskell -
IORefCAS
A collection of different packages for CAS based data structures. -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
dependent-map
Dependently-typed finite maps (partial dependent products) -
discrimination
Fast linear time sorting and discrimination for a large class of data types -
json-autotype
Automatic Haskell type inference from JSON input -
audiovisual
Extensible records, variants, structs, effects, tangles -
-
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
protobuf
An implementation of Google's Protocol Buffers in Haskell. -
safecopy
An extension to Data.Serialize with built-in version control -
-
-
bifunctors
Haskell 98 bifunctors, bifoldables and bitraversables -
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
uuid-types
A Haskell library for creating, printing and parsing UUIDs -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
-
typerep-map
⚡️Efficient implementation of Map with types as keys
Static code analysis for 29 languages.
Do you think we are missing an alternative of free-functors or a related project?
|
Less time debugging, more time building
sponsored
scoutapm.com
|
Popular Comparisons
-
CBORvsprotobuf
-
network-addressvsradius
-
json-autotypevsbase58string
-
boringvsbinary
-
avrovsprotobuf
|
OPS - Build and Run Open Source Unikernels
sponsored
github.com/nanovms
|
README
free-functors
A free functor is a left adjoint to a forgetful functor. It used to be the case that the only category that was easy to work with in Haskell was Hask itself, so there were no interesting forgetful functors.
But the new ConstraintKinds feature of GHC provides an easy way of creating subcategories of Hask. That brings interesting opportunities for free (and cofree) functors.
The examples directory contains an implementation of non-empty lists as free semigroups, and automata as free actions. The standard example of free higher order functors is free monads, and this definition can be found in Data.Functor.HFree.