Showing entries 3501-3600 out of 54071.
Use Accessor to access state in transformers State monad
Geometric angles
Compatibility layer for Data
Simple extensible sum
Type-safe, bytestring-based ASCII values
Combinator birds
Utilities for accessing and comparing types based on so called bases - representations with limite…
A database library with a focus on ease of use, type safety and useful error messages
Parser/Serialiser for IEEE-754 floating-point values
Extra operations on binary words of fixed length
A rotating sequence data structure
Category theory
Generic cellular data representation library
Library for checking and normalization of data (e.g. from web forms)
Type-indexed runtime-checked properties
Simple functional ring type
Generate a special combinator from any data type
Define Backwards Compatibility Schemes for Arbitrary Data
A Library for directional queues
Data construction abstractions including Constructor, Destructor, Maker, Destroyer, Producer and C…
Generically compare data by their constructors
A cyclic doubly linked list
A class for types with a default value
A class for types with a default value
A class for types with a default value
A class for types with a default value (compatibility shim)
A class for types with a default value
A class for types with a default value
Default instances for types in base
Default instances for (lazy and strict) ByteString, Builder and ShortByteString
Default instance for CI type from case-insensitive package
Default instances for types in containers
Default instances for types in containers
Default instances for types in dlist
Default instances for types in newer versions of base package
Default instances for types in old-locale
Default instances for (lazy and strict)
Default instances for unordered-containers
Default instances for types defined in vector package
Space-efficient and privacy-preserving data dispersal algorithms
Extensible records and polymorphic variants
Isos & Lens for Data
Stick two binary words together to get a bigger one
Consistent set of utility functions for Maybe, Either, List and Monoids
A basic framework for effect systems based on effects represented by GADTs
A basic framework for effect systems based on effects represented by GADTs
Template Haskell utilities for the data-effects library
Coerce between unlifted boxed and lifted types
Executable and Linkable Format (ELF) data structures
Embed files and other binary blobs inside executables without Template Haskell
Combinator emoticons: data-aviary in the flavor of emoticons
Endian-sensitive data
Extend Haskell data or newtype like in OOP languages
A type safe file path data structure
Generate data-files Cabal file field from existing files
Utilities for filtering
Finite totally ordered sets
Simple integral finite set
Fixpoint data types
Common subexpression elimination for the fixploint types
A package for working with bit masks and flags in general
An efficient data type for sets of flags
Fold function applications
Specify that lifted values were forced to WHNF or NF
A simple multi-way tree data structure
Interface and functor transformers for fresh values
Map the arguments and return value of functions
Write functions in tacit (pointless) style using Applicative and De Bruijn index notation
Updatable analogue of Distributive functors
Simple extensible product
Combinators for building fast hashing functions
Provide a simple consistent hashing mechanism
Extending the concept of indices for lists and other containers
Interval datatype, interval arithmetic and interval-based containers
A simple lazy, infinite trie from integers
Write-once variables with concurrency support
Json Token datatype
Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable…
Data layering utilities
Read/write arbitrary binary layouts to a "Data.Vector
Used to be Haskell 98 Lenses
A Lens for IxSet
Simple lenses, minimum dependencies
Utilities for Data
Utilities for working with sequences within lists
A list but with a balanced enumeration of Cartesian product
Combinators for building memo tables
A Haskell implementation of MessagePack
A Haskell implementation of MessagePack
Data types for named entities
Data Nat = Zero | Succ Nat
Represent hierachichal structures, called objects in JSON
Serialize JSON data to/from Haskell using the data-object library
Serialize data to and from Yaml files (deprecated)
A data type for non-exclusive disjunction
Set and bag operations on ordered lists
A pure disjoint set (union find) data structure