Haskell Data Structures

A dependently typed functional programming language and proof assistant

A tasty Haskell front-end framework

Assorted concrete container types

Extensible Records

Implementation of Univalence in Cubical Sets

Packing and unpacking flat tables.

A distribution of the 'containers' package, with all modules exposed.

Scalar data types and conversions.

Bulk array representations and operators.

Low-level parallel operators on bulk random-accessble arrays.

A framework for generating singleton types

A Haskell version of an Ethereum client

Pure priority search queues

A language based on homotopy type theory with an interval type

Compiles Clafer models to other formats

Anonymous records and overloaded labels

Distributive functors -- Dual to Traversable

A purely functional and persistent hash map

A Haskell 98 logically uninhabited data type

A space-efficient set data structure.

A library of efficient, purely-functional data structures (API)

Type-level sets and finite maps (with value-level counterparts)

Asymptotically optimal Brodal/Okasaki heaps.

Anonymous extensible records

claferIG is an interactive tool that generates instances of Clafer models.

Efficient relational queries on Haskell sets.

Very strict CPS'd transformers

Bindings to the igraph C library.

Extensions to Data.Map

R-Tree is a spatial data structure similar to Quadtrees or B-Trees.

Syntax sugar for defining maps

Simple functional ring type.

Support for image reading and writing of Repa arrays using in-place FFI calls

The Data.MultiSet container type

Composition trees for arbitrary monoids.

A modified Merkle Patricia DB

Program to derive type class instances

Program to derive type class instances

Dependently typed elimination functions using singletons

An efficient implementation of maps from strings to arbitrary values

A backend agnostic, concurrent BTree

Regional memory pointers

Efficient relational queries on Haskell sets.

Combinators for unorthodox structure composition

Plugin and base library to support supermonads in Haskell

Open type representations and dynamic types

An efficient finite map from (byte)strings to values.

Type-safe file handling

Ethereum Recursive Length Prefix Encoding

Type composition classes & instances

Queues with verified and unverified versions.

BK-tree implementation

Combinators for unorthodox function composition

Styled console text output using ANSI escape sequences.

Render just the Agda snippets of a literate Agda file to HTML

type-level binary search trees in haskell

bidirectional arrows, bijective functions, and invariant functors

A library for permutations and combinations.

Monoids with holes.

Heaps in Haskell

Optimised list functions for doing index-related things

Permissions for bookkeeper records

Type-safe communication with USB devices.

Memoization combinators using arrays for finite sub-domains of functions

Prototypical type checker for Type Theory with Sized Natural Numbers

Boxed and unboxed arrays for monad transformers

Perform fft with repa via FFTW

Reading and writing sound files with repa arrays

"Ties the knot" on a given set of structures that reference each other by keys.

Extends safer-file-handles with Text operations

Subword graph implementation

Extends safer-file-handles with ByteString operations

The basic stack type

Simple and moderately efficient suffix array implementation

Typechecking terms of the Edinburgh Logical Framework (LF).

Conceptual modelling support for Haskell

Packed, strict nibble arrays with a list interface (ByteString for nibbles)

A Ethereum contract analyzer.