Haskell Data Structures

A dependently typed functional programming language and proof assistant

Assorted concrete container types

Extensible Records

Implementation of Univalence in Cubical Sets

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

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

Scalar data types and conversions.

Bulk array representations and operators.

Packing and unpacking flat tables.

A framework for generating singleton types

A Haskell version of an Ethereum client

A language based on homotopy type theory with an interval type

Pure priority search queues

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)

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

Asymptotically optimal Brodal/Okasaki heaps.

Anonymous extensible records

Efficient relational queries on Haskell sets.

Extensions to Data.Map

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

Very strict CPS'd transformers

Bindings to the igraph C library.

A modified Merkle Patricia DB

Syntax sugar for defining maps

The Data.MultiSet container type

Simple functional ring type.

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

Composition trees for arbitrary monoids.

An efficient implementation of maps from strings to arbitrary values

Program to derive type class instances

Program to derive type class instances

Combinators for unorthodox structure composition

Efficient relational queries on Haskell sets.

Plugin and base library to support supermonads in Haskell

Regional memory pointers

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

Open type representations and dynamic types

A backend agnostic, concurrent BTree

Type composition classes & instances

Ethereum Recursive Length Prefix Encoding

Type-safe file handling

Queues with verified and unverified versions.

Combinators for unorthodox function composition

BK-tree implementation

bidirectional arrows, bijective functions, and invariant functors

A library for permutations and combinations.

Heaps in Haskell

type-level binary search trees in haskell

Prototypical type checker for Type Theory with Sized Natural Numbers

Memoization combinators using arrays for finite sub-domains of functions

Styled console text output using ANSI escape sequences.

Optimised list functions for doing index-related things

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

Permissions for bookkeeper records

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.

Monoids with holes.

Subword graph implementation

Type-safe communication with USB devices.

The basic stack type

Simple and moderately efficient suffix array implementation

Extends safer-file-handles with Text operations

Extends safer-file-handles with ByteString operations

Conceptual modelling support for Haskell

Typechecking terms of the Edinburgh Logical Framework (LF).

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

A Ethereum contract analyzer.