19,399 packages · page 47 of 194
| Package ▲ | Version | Maintainers | # | Teams | Deps | Used by | Used by (transitive) | Status |
|---|---|---|---|---|---|---|---|---|
A basic framework for effect systems based on effects represented by GADTs |
0.4.2.0 |
0 | 18 | 2 | 2 | unmaintained | ||
A basic framework for effect systems based on effects represented by GADTs |
0.4.3.0 |
0 | 14 | 2 | 4 | unmaintained | ||
Template Haskell utilities for the data-effects library |
0.4.2.1 |
0 | 16 | 1 | 3 | unmaintained | ||
Coerce between unlifted boxed and lifted types |
0.3 |
0 | 9 | 2 | 2 | unmaintained | ||
Executable and Linkable Format (ELF) data structures |
0.2 |
0 | 9 | 0 | 0 | unmaintained | ||
Embed files and other binary blobs inside executables without Template Haskell |
0.1.0.0 |
0 | 10 | 0 | 0 | unmaintained | ||
Combinator emoticons: data-aviary in the flavor of emoticons |
0.1.0 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Endian-sensitive data |
0.1.1 |
0 | 6 | 4 | 30 | unmaintained | ||
Extend Haskell data or newtype like in OOP languages |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained | ||
None |
2.5.5 |
0 | 6 | 0 | 0 | unmaintained | ||
A type safe file path data structure |
2.2.0.0 |
0 | 9 | 0 | 0 | unmaintained broken | ||
Generate data-files Cabal file field from existing files |
0.0.0.1 |
0 | 8 | 0 | 0 | unmaintained | ||
Utilities for filtering |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained | ||
Finite totally ordered sets |
0.1.1.3 |
0 | 12 | 0 | 0 | unmaintained broken | ||
Simple integral finite set |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Find cycles in periodic functions (and lists) |
0.1.2.0 → 0.1.2.1 |
0 | 12 | 0 | 0 | unmaintained outdated | ||
Fixpoint data types |
0.3.4 |
0 | 7 | 39 | 16,662 | unmaintained | ||
Common subexpression elimination for the fixploint types |
0.0.3 |
0 | 7 | 1 | 8 | unmaintained | ||
A package for working with bit masks and flags in general |
0.0.3.4 |
0 | 6 | 7 | 14 | unmaintained | ||
An efficient data type for sets of flags |
1.0.0.0 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Fold function applications. Framework for variadic functions. |
0.1.1.0 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Specify that lifted values were forced to WHNF or NF |
0.3.0.0 |
0 | 8 | 0 | 0 | unmaintained broken | ||
A simple multi-way tree data structure |
0.1.0.13 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Interface and functor transformers for fresh values |
0.2013.251.0 |
0 | 7 | 0 | 0 | unmaintained | ||
Map the arguments and return value of functions |
0.1.1.0 |
0 | 6 | 0 | 0 | unmaintained | ||
Write functions in tacit (pointless) style using Applicative and De Bruijn index notation |
0.1.0.0 |
0 | 6 | 0 | 0 | unmaintained | ||
Updatable analogue of Distributive functors |
0.0 |
0 | 7 | 1 | 17 | unmaintained | ||
Simple extensible product |
0.4.0.0 |
0 | 6 | 8 | 13 | unmaintained | ||
Combinators for building fast hashing functions |
0.2.0.1 |
0 | 9 | 10 | 45 | unmaintained | ||
Extending the concept of indices for lists and other containers |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Interval datatype, interval arithmetic and interval-based containers |
2.1.2 |
0 | 18 | 6 | 19 | unmaintained | ||
A simple lazy, infinite trie from integers |
0.1.4 |
0 | 6 | 2 | 31 | unmaintained | ||
Write-once variables with concurrency support |
0.30 |
0 | 6 | 2 | 4 | unmaintained broken | ||
Json Token datatype |
0.1.0.0 |
0 | 6 | 0 | 0 | unmaintained | ||
Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable lazy structure |
0.1.0.0 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Data layering utilities. Layer is a data-type which wrapps other one, but keeping additional information. If you want to access content of simple newtype object, use Lens.Wrapper instead. |
1.0.4 |
0 | 9 | 0 | 0 | unmaintained | ||
Read/write arbitrary binary layouts to a "Data.Vector.Storable". |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained | ||
Used to be Haskell 98 Lenses |
2.11.2 |
0 | 9 | 29 | 37 | unmaintained | ||
Lenses |
2.0.6 |
0 | 8 | 7 | 8 | unmaintained broken | ||
A Lens for IxSet |
0.1.4 |
0 | 9 | 0 | 0 | unmaintained | ||
Simple lenses, minimum dependencies |
0.1.2.4 |
1 | 6 | 12 | 60 | single | ||
Utilities for Data.Lens |
2.2 |
0 | 7 | 15 | 18 | unmaintained broken | ||
Utilities for working with sequences within lists |
0.1 |
0 | 6 | 0 | 0 | unmaintained | ||
A list but with a balanced enumeration of Cartesian product |
0.1.1.1 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Data.Map with multiple, unique keys |
0.0.1.2 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Combinators for building memo tables |
0.5.1 |
0 | 7 | 13 | 29 | unmaintained | ||
A Haskell implementation of MessagePack |
0.0.13 |
0 | 15 | 9 | 9 | unmaintained | ||
A Haskell implementation of MessagePack |
0.0.3 |
0 | 12 | 3 | 10 | unmaintained | ||
Data types for named entities |
0.6.2 |
0 | 7 | 2 | 2 | unmaintained broken | ||
data Nat = Zero | Succ Nat |
0.1.2 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Represent hierachichal structures, called objects in JSON. (deprecated) |
0.3.1.9 |
0 | 7 | 3 | 3 | unmaintained broken | ||
Serialize JSON data to/from Haskell using the data-object library. (deprecated) |
0.3.1.8 |
0 | 11 | 0 | 0 | unmaintained | ||
Serialize data to and from Yaml files (deprecated) |
0.3.4.2 |
0 | 11 | 1 | 1 | unmaintained | ||
A data type for non-exclusive disjunction |
1.0.0.12 |
0 | 6 | 0 | 0 | unmaintained | ||
Set and bag operations on ordered lists |
0.4.7.0 |
0 | 6 | 27 | 504 | unmaintained | ||
A pure disjoint set (union find) data structure |
0.3.0.0 |
0 | 6 | 1 | 1 | unmaintained | ||
Read PDF form fields |
0.1.1.0 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Prettyprint and compare Data values |
0.2.4.2 |
0 | 7 | 3 | 3 | unmaintained broken | ||
Prometheus metrics text format |
0.1.0.0 |
0 | 9 | 0 | 0 | unmaintained | ||
Reference cells that need two independent indices to be accessed |
0.1 |
0 | 6 | 0 | 0 | unmaintained broken | ||
R-Tree is a spatial data structure similar to Quadtrees or B-Trees |
0.6.0 |
0 | 12 | 1 | 3 | unmaintained broken | ||
Unify STRef and IORef in plain Haskell 98 |
0.1 |
1 | 7 | 2 | 4 | single | ||
Reify a recursive data structure into an explicit graph |
0.6.4 |
0 | 10 | 11 | 83 | unmaintained | ||
Common Sub-Expression Elimination for graphs generated by Data.Reify. |
0.0.3 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Data.Reify for GADTs |
0.1.0.1 |
0 | 9 | 0 | 0 | unmaintained | ||
Alternative to Show data printing utility |
1.0 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Data types for returning results distinguishable by types |
1.0 |
0 | 8 | 0 | 0 | unmaintained | ||
A typeclass for reversing order of contents |
0.1.0.1 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Ropes, an alternative to (Byte)Strings |
0.3 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Recursive tuple data structure. It is very usefull when implementing some lo-level operations, allowing to traverse different elements using Haskell's type classes. |
1.0 |
0 | 8 | 0 | 0 | unmaintained | ||
Common API for serialization libraries |
0.3.5 |
0 | 12 | 4 | 27 | unmaintained | ||
Profiling of data structures |
0.1.1.7 |
0 | 6 | 0 | 0 | unmaintained broken | ||
0.3.1.0 |
0 | 16 | 1 | 21 | unmaintained | |||
0.1.0.0 |
0 | 10 | 2 | 23 | unmaintained | |||
0.3.0.0 |
0 | 8 | 0 | 0 | unmaintained | |||
Stochastic streaming algorithms for approximate computation on large datasets. Includes KLL, HLL, Theta, Count-Min, and REQ sketches. |
0.4.0.1 |
0 | 15 | 0 | 0 | unmaintained | ||
Deprecated. Now called "spacepart". Space partitioning data structures. |
20090215.0 |
0 | 7 | 0 | 0 | unmaintained broken | ||
A collection of standards representable by simple data types |
0.1.0.2 |
0 | 8 | 0 | 0 | unmaintained broken | ||
ARM SVD and CubeMX XML parser and pretty printer for STM32 family |
0.1.0.0 |
1 | 11 | 0 | 0 | single | ||
Type safe, in-memory dictionary with multidimensional keys |
0.3.0.7 |
0 | 13 | 1 | 1 | unmaintained broken | ||
An efficient implementation of maps from strings to arbitrary values |
1.0.1.1 |
0 | 12 | 3 | 6 | unmaintained broken | ||
Program that infers the fastest data structure available for your program |
1.0 |
0 | 14 | 0 | 0 | unmaintained | ||
SVD (System view description) file handling |
0.1.2.0 → 0.1.3.0 |
0 | 20 | 1 | 1 | unmaintained outdated | ||
Shorter binary words |
0.2.0.3 |
0 | 10 | 4 | 6 | unmaintained | ||
Tensor and Group typeclasses |
0.1.0.0 |
0 | 6 | 0 | 0 | unmaintained | ||
Human-friendly textual representations |
0.3.0.3 |
0 | 13 | 5 | 22 | unmaintained | ||
64-bit timeouts of nanosecond precision |
0.3.1 |
0 | 11 | 0 | 0 | unmaintained | ||
Functions to transform data structures |
0.1.1.0 |
0 | 6 | 0 | 0 | unmaintained | ||
Print Data instances as a nested tree |
0.1.0.2 |
0 | 8 | 1 | 1 | unmaintained | ||
Reify a recursive data structure into an explicit graph |
0.3.4 |
0 | 7 | 2 | 2 | unmaintained | ||
Basic type wrangling types and classes |
0.1.0 |
0 | 6 | 3 | 3 | unmaintained broken | ||
utilities for handle data |
0.5 |
0 | 6 | 0 | 0 | unmaintained broken | ||
A library for creating type safe validations |
0.1.2.5 |
0 | 8 | 0 | 0 | unmaintained broken | ||
A variant data type, useful for modeling dynamically-typed programming languages |
0.28.0.5 |
0 | 7 | 1 | 2 | unmaintained broken | ||
Dynamic growable resizable mutable generic vector |
0.0.1 |
0 | 10 | 0 | 0 | unmaintained broken | ||
Class for types with a database id |
0.1.0.1 |
0 | 8 | 1 | 1 | unmaintained | ||
HasId/Groundhog interop |
0.1.0.1 |
0 | 9 | 0 | 0 | unmaintained | ||
Database versioning and migration (experimental) |
0.2.0 |
0 | 10 | 0 | 0 | unmaintained broken | ||
Demonstrate how a database can be implemented the functional way |
0.0.1 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Encryption library |
1.1.0 |
0 | 6 | 0 | 0 | unmaintained |