subcategories alternatives and similar packages

Based on the "Data" category.
Alternatively, view subcategories alternatives based on common mentions on social networks and blogs.

lens

10.0 6.8 subcategories VS lens

Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
semantic-source

10.0 9.1 subcategories VS semantic-source

Parsing, analyzing, and comparing source code across many languages

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com

hnix

9.9 6.8 subcategories VS hnix

A Haskell re-implementation of the Nix expression language
code-builder

9.8 0.0 subcategories VS code-builder

Packages for defining APIs, running them, generating client code and documentation.
text

9.8 8.4 subcategories VS text

Haskell library for space- and time-efficient operations over Unicode text.
Frames

9.7 6.1 subcategories VS Frames

Data frames for tabular data.
cassava

9.7 5.9 subcategories VS cassava

A CSV parsing and encoding library optimized for ease of use and high performance
compendium-client

9.7 0.0 subcategories VS compendium-client

Mu (μ) is a purely functional framework for building micro services.
unordered-containers

9.7 5.0 subcategories VS unordered-containers

Efficient hashing-based container types
massiv

9.7 5.9 subcategories VS massiv

Efficient Haskell Arrays featuring Parallel computation
holmes

9.6 0.0 subcategories VS holmes

A reference library for constraint-solving with propagators and CDCL.
alfred-margaret

9.5 3.5 subcategories VS alfred-margaret

Fast Aho-Corasick string searching
resource-pool

9.5 0.0 subcategories VS resource-pool

A high-performance striped resource pooling implementation for Haskell
hashable

9.5 5.7 subcategories VS hashable

A class for types that can be converted to a hash value
refined

9.5 1.5 subcategories VS refined

Refinement types with static checking
binary

9.5 4.3 subcategories VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
critbit

9.5 0.0 subcategories VS critbit

A Haskell implementation of crit-bit trees.
primitive

9.5 5.9 subcategories VS primitive

This package provides various primitive memory-related operations.
caledon

9.4 0.0 subcategories VS caledon

higher order dependently typed logic programing
data-msgpack

9.4 subcategories VS data-msgpack

A Haskell implementation of MessagePack
hashtables

9.4 1.0 subcategories VS hashtables

Mutable hash tables for Haskell, in the ST monad
discrimination

9.4 3.1 subcategories VS discrimination

Fast linear time sorting and discrimination for a large class of data types
higgledy

9.4 2.2 subcategories VS higgledy

Higher-kinded data via generics
aeson-qq

9.4 3.6 subcategories VS aeson-qq

JSON quasiquoter for Haskell
network-msgpack-rpc

9.4 subcategories VS network-msgpack-rpc

A MessagePack-RPC Implementation
jump

9.4 0.0 subcategories VS jump

Jump start your Haskell development
diskhash

9.4 0.0 subcategories VS diskhash

Diskbased (persistent) hashtable
json-autotype

9.4 0.0 subcategories VS json-autotype

Automatic Haskell type inference from JSON input
dependent-map

9.3 0.0 subcategories VS dependent-map

Dependently-typed finite maps (partial dependent products)
audiovisual

9.3 3.5 subcategories VS audiovisual

Extensible records, variants, structs, effects, tangles
reflection

9.3 4.8 subcategories VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
IORefCAS

9.3 3.5 subcategories VS IORefCAS

A collection of different packages for CAS based data structures.
dependent-sum

9.3 4.3 subcategories VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
cereal

9.3 0.0 subcategories VS cereal

A binary serialization library
certificate

9.3 0.0 subcategories VS certificate

Certificate and Key Reader/Writer in haskell
protobuf

9.2 2.6 subcategories VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
safecopy

9.2 3.1 subcategories VS safecopy

An extension to Data.Serialize with built-in version control
orgmode-parse

9.2 0.0 subcategories VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
streaming

9.2 0.0 subcategories VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
rei

9.2 0.0 subcategories VS rei

Process lists easily
bifunctors

9.2 5.6 subcategories VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
avro

9.2 4.2 subcategories VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
scientific

9.2 0.0 subcategories VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
MemoTrie

9.1 2.7 subcategories VS MemoTrie

Trie-based memo functions
uuid

9.1 2.9 subcategories VS uuid

A Haskell library for creating, printing and parsing UUIDs
b-tree

9.1 1.8 subcategories VS b-tree

Haskell on-disk B* tree implementation
uuid-types

9.1 2.9 subcategories VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
text-icu

9.1 6.1 subcategories VS text-icu

This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
witherable

9.1 6.4 subcategories VS witherable

Filter with effects
stdio

9.1 1.8 subcategories VS stdio

Haskell Standard Input and Output

Do you think we are missing an alternative of subcategories or a related project?

Add another 'Data' Package

Popular Comparisons

README

The `subcategories` package

Hackage Hackage-Deps

This package provides variants of functor-like structures, with domain types are constrained. In particular, this package provides an abstraction for functorial containers, which can be expressed as a functor from a full-subcategory of Hask to Hask itself ¹.

For example:

We can treat Set as if it is a Fuctor, Foldable, Applicative, with their domain restricted to full-subcategory Ord of Ord instances of Hask.
For MonoFoldable or MonoTraversable types (from mono-traversable package), we provide WrapMono wrapper with zero-cost coercion. Such monos can be regarded as a functorial structure from the full subcategory consisting of just a single object, say Element mono.

Optimisation

This library is designed to keep the abstraction runtime overhead as minimum as possible.

Some notes:

If a constrained term such as cmap or czipWith has concrete type, it must have exactly the same representation as the corresponding operation modulo (zero-cost) coercion.
- The same still holds if the set of required constraints coincides.
- Although the constructor of WrapMono mono a is hidden, its just a newtype-wrapper around mono; hence, constrained operators must have the same representations as the corresponding combinators in mono-traversable package.
OTOH, for a polymorphic term, like cmap :: (Ord a, Ord b) => (a -> b) Set a -> Set b and Set.map, they can have different representations; indeed, Set.map doesn't require a to be Ord-instance and therefore the implementation of cmap discards the dictionary for Ord a to call Set.map.