8,403 packages · page 19 of 85
| Package ▲ | Version | Maintainers | # | Teams | Deps | Used by | Used by (transitive) | Status |
|---|---|---|---|---|---|---|---|---|
Default instances for types in newer versions of base package |
0.0.2 |
0 | 7 | 1 | 4 | unmaintained broken | ||
Default instances for types in old-locale |
0.0.1.2 |
0 | 8 | 2 | 7 | unmaintained broken | ||
Default instances for (lazy and strict) Text and Text Builder |
0.0.1 |
0 | 7 | 1 | 4 | unmaintained broken | ||
Default instances for unordered-containers |
0.0.1 |
0 | 8 | 1 | 4 | unmaintained broken | ||
Default instances for types defined in vector package |
0.0.1 |
0 | 8 | 2 | 5 | unmaintained broken | ||
Space-efficient and privacy-preserving data dispersal algorithms |
1.0.0.2 |
0 | 17 | 0 | 0 | unmaintained broken | ||
Isos & Lens for Data.Diverse.Many and Prisms for Data.Diverse.Which |
4.3.0.0 |
0 | 12 | 3 | 5 | unmaintained broken | ||
Consistent set of utility functions for Maybe, Either, List and Monoids |
0.7.0 |
0 | 13 | 1 | 1 | unmaintained broken | ||
Combinator emoticons: data-aviary in the flavor of emoticons |
0.1.0 |
0 | 6 | 0 | 0 | unmaintained broken | ||
A type safe file path data structure |
2.2.0.0 |
0 | 9 | 0 | 0 | unmaintained broken | ||
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 | ||
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 | ||
Extending the concept of indices for lists and other containers |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Write-once variables with concurrency support |
0.30 |
0 | 6 | 2 | 4 | unmaintained broken | ||
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 | ||
Lenses |
2.0.6 |
0 | 8 | 7 | 8 | unmaintained broken | ||
Utilities for Data.Lens |
2.2 |
0 | 7 | 15 | 18 | unmaintained broken | ||
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 | ||
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 | ||
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 | ||
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 | ||
Common Sub-Expression Elimination for graphs generated by Data.Reify. |
0.0.3 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Alternative to Show data printing utility |
1.0 |
0 | 8 | 0 | 0 | unmaintained broken | ||
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 | ||
Profiling of data structures |
0.1.1.7 |
0 | 6 | 0 | 0 | unmaintained broken | ||
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 | ||
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 | ||
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 | ||
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 | ||
Datadog client for Haskell. Supports both the HTTP API and StatsD. |
0.3.0.0 |
0 | 24 | 1 | 2 | unmaintained broken | ||
SIMD-accelerated CSV reader for the dataframe library |
1.0.0.0 → 1.4.1.1 |
0 | 12 | 0 | 0 | unmaintained broken outdated | ||
An implementation of datalog in Haskell |
0.2.0.2 |
0 | 12 | 0 | 0 | unmaintained broken | ||
Tool to help pack files into the minimum number of CDs/DVDs/etc |
1.0.1 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Client for DataRobot API |
1.0.1 |
0 | 15 | 0 | 0 | unmaintained broken | ||
Small library for parsing different dates formats |
0.2.3.3 |
0 | 9 | 8 | 10 | unmaintained broken | ||
Utilities to make Data.Time.* easier to use |
0.3.1 |
0 | 13 | 11 | 11 | unmaintained broken | ||
Utilities to make Data.Time.* easier to use. |
0.2.4 |
0 | 13 | 0 | 0 | unmaintained broken | ||
Generates DDL suggestions based on a CSV file |
0.1.0.2 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Directed acyclic word graphs |
0.11 |
0 | 8 | 7 | 9 | unmaintained broken | ||
Directed acyclic word graphs |
0.5.1.2 |
0 | 13 | 1 | 1 | unmaintained broken | ||
Generation and traversal of compressed directed acyclic dawg graphs |
1.0.0 |
0 | 15 | 0 | 0 | unmaintained broken | ||
Helpers for round-trip tests |
1.0.1 |
0 | 11 | 5 | 5 | unmaintained broken | ||
Clean database tables automatically around hspec tests |
0.1.3 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Read and write XBase ".dbf" files |
0.0.0.2 |
0 | 8 | 1 | 1 | unmaintained broken | ||
A *simple* database migration tool |
0.3 |
0 | 10 | 0 | 0 | unmaintained broken | ||
An implementation of relational database "migrations" |
2.1.0 |
0 | 17 | 3 | 3 | unmaintained broken | ||
Data consistency alerting for PostgreSQL |
0.1.0 |
0 | 18 | 0 | 0 | unmaintained broken | ||
Simple app launcher for D-Bus |
0.1.1.0 |
0 | 10 | 0 | 0 | unmaintained broken | ||
Low-level D-Bus protocol implementation |
0.9.3 |
0 | 11 | 10 | 18 | unmaintained broken | ||
Quasi-quoter for DBus functions |
0.1.0 |
0 | 8 | 0 | 0 | unmaintained broken | ||
This packge is deprecated. See the the "LIO.DCLabel" in the "lio" package. |
0.9.0.0 |
0 | 11 | 0 | 0 | unmaintained broken | ||
The Disjunction Category Label Format |
0.3 |
0 | 7 | 1 | 1 | unmaintained broken | ||
DCPU-16 Emulator & Assembler |
0.1.0.2 |
0 | 10 | 0 | 0 | unmaintained broken | ||
Disciplined Disciple Compiler common utilities |
0.4.2.1 |
0 | 7 | 4 | 4 | unmaintained broken | ||
Disciplined Disciple Compiler base libraries |
0.4.3.2 |
0 | 6 | 1 | 1 | unmaintained broken | ||
detect dead code in haskell projects |
0.8.1 |
0 | 17 | 0 | 0 | unmaintained broken | ||
Dead simple JSON parser, with some Template Haskell sugar |
0.1.2 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Haskell bindings for Dear ImGui |
2.4.1 → 2.5.0 |
0 | 98 | 1 | 1 | unmaintained broken outdated | ||
secure remote debugging |
1.20221231 |
0 | 32 | 0 | 0 | unmaintained broken | ||
A preprocessor for the debug package |
0.1.1 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Like Debug.Trace but writing to files. |
1.0.0.1 |
0 | 8 | 0 | 0 | unmaintained broken | ||
More useful trace functions for investigating bugs |
0.1.0.3 |
0 | 8 | 0 | 0 | unmaintained broken | ||
Write your GDB scripts in Haskell |
0.1.1.0 |
0 | 9 | 0 | 0 | unmaintained broken | ||
The categorical dual of transformers |
0.1.0.0 |
0 | 7 | 0 | 0 | unmaintained broken | ||
Binary Decision Diagrams (BDD) and Zero-suppressed Binary Decision Diagrams (ZDD) |
0.2.0.0 |
0 | 23 | 1 | 1 | unmaintained broken | ||
Conduit for decoding ByteStrings using Data.Binary.Get |
0.0.1.1 |
0 | 7 | 0 | 0 | unmaintained broken | ||
A library that provides deep-level programming style and(or) notation on Applicative and Monad |
0.5.4.3 |
0 | 11 | 0 | 0 | unmaintained broken | ||
Call DeepL to translate you files |
0.1.0.1 |
0 | 16 | 0 | 0 | unmaintained broken | ||
Deep Learning in Haskell |
0.1.0.2 |
0 | 13 | 0 | 0 | unmaintained broken | ||
Bounded deepseq, including support for generic deriving |
0.8.0.0 |
0 | 13 | 2 | 2 | unmaintained broken | ||
Candidate NFData Instances for Types in base |
0.1.0.1 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Deep evaluation of data structures without NFData |
1.0.0.3 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Template Haskell based deriver for optimised NFData instances |
0.1.0.4 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Applicative maps |
1.0.2 |
0 | 7 | 0 | 0 | unmaintained broken | ||
The base modules of the Definitive framework |
2.3 |
0 | 11 | 6 | 6 | unmaintained broken | ||
Defunctionalization helpers: booleans |
0.1 → 0.1.0.1 |
0 | 8 | 1 | 1 | unmaintained broken outdated | ||
Small and typesafe configuration library |
0.5.0.1 |
0 | 6 | 1 | 1 | unmaintained broken | ||
Decimal floating point arithmetic |
0.6.0.2 |
0 | 6 | 1 | 1 | unmaintained broken | ||
Delaunay tessellation |
0.1.0.2 |
0 | 11 | 1 | 1 | unmaintained broken | ||
Facilities for storing a Haskell value, using delta types |
1.0.0.0 |
0 | 12 | 0 | 0 | unmaintained broken | ||
Generalized the Prelude more functionally |
0.1.0.3 |
0 | 6 | 0 | 0 | unmaintained broken | ||
Demangler for C++ mangled names |
1.3.2.0 |
0 | 12 | 0 | 0 | unmaintained broken | ||
Demarcating transformed monad |
0.1.0 |
0 | 8 | 0 | 0 | unmaintained broken |