treeowl Goto Github PK

abelian

Commutative Applicatives and Semigroups

adjunctions

Simple adjunctions

apply-unordered

Experiments in type-directed function application and argument reordering

async

Run IO operations asynchronously and wait for their results

atomic-modify-general

Generalizations of Haskell's atomicModifyIORef

attoparsec

A fast Haskell library for parsing ByteStrings

base16

bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables

binary

Efficient, pure binary serialisation using ByteStrings in Haskell.

bitset

A compact functional set data structure

bitvec

Bit vectors: 8x less memory, up to 1000x faster than Vector Bool

bloomfilter

A fast Haskell Bloom filter library.

boolset

Sets and nonempty sets of Boolean values

boring

Boring and Absurd types

bound

Combinators for manipulating locally-nameless generalized de Bruijn terms

bytestring

An efficient compact, immutable byte string type (both strict and lazy) suitable for binary or 8-bit character data.

cabal

Cabal and cabal-install

cardano-sl

Cryptographic currency implementing Ouroboros PoS protocol

cassava

Easy CSV parsing

chessai

chesskell

coercible-utils

Utility functions for Coercible types

comonadsheet

A library for expressing "spreadsheet-like" computations with absolute and relative references, using fixed-points of n-dimensional comonads.

compact-sequences

Stacks and queues with compact representations

configurator

A Haskell library supporting flexible, dynamic file-based configuration.

constraints

Tools for programming with ConstraintKinds in GHC

constraints-extras

Convenience functions and template haskell for working with constraints

containers

Assorted concrete container types

contravariant

Haskell 98 contravariant functors

data-category

Library of categories, with categorical constructions on them