Haskell Data Structures

A tasty Haskell front-end framework

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.

A framework for generating singleton types

Bulk array representations and operators.

Packing and unpacking flat tables.

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

Scalar data types and conversions.

A Haskell version of an Ethereum client

A language based on homotopy type theory with an interval type

Pure priority search queues

Anonymous records and overloaded labels

Compiles Clafer models to other formats

Distributive functors -- Dual to Traversable

A Haskell 98 logically uninhabited data type

A purely functional and persistent hash map

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.

Keyed container types with verified keys.

Efficient relational queries on Haskell sets.

Bindings to the igraph C library.

Very strict CPS'd transformers

Extensions to Data.Map

The Data.MultiSet container type

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

Composition trees for arbitrary monoids.

Combinators for operating with selections over an underlying functor

A modified Merkle Patricia DB

Program to derive type class instances

Program to derive type class instances

Combinators for unorthodox structure composition

Typechecking terms of the Edinburgh Logical Framework (LF).

Dependently typed elimination functions using singletons

A backend agnostic, concurrent BTree

An efficient implementation of maps from strings to arbitrary values

Regional memory pointers

Ethereum Recursive Length Prefix Encoding

Efficient relational queries on Haskell sets.

Plugin and base library to support supermonads in Haskell

Type-safe file handling

Open type representations and dynamic types

Styled console text output using ANSI escape sequences.

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

Combinators for unorthodox function composition

Type composition classes & instances

Queues with verified and unverified versions.

A library for permutations and combinations.

Boxed and unboxed arrays for monad transformers

Optimised list functions for doing index-related things

BK-tree implementation

Prototypical type checker for Type Theory with Sized Natural Numbers

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

Monoids with holes.

type-level binary search trees in haskell

Heaps in Haskell

Memoization combinators using arrays for finite sub-domains of functions

Permissions for bookkeeper records

Type-safe communication with USB devices.

A Ethereum contract analyzer.

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 ByteString operations

bidirectional arrows, bijective functions, and invariant functors

Subword graph implementation

Extends safer-file-handles with Text operations

The basic stack type

Graphs and networks library

Simple and moderately efficient suffix array implementation

Efficient representable functors

Conceptual modelling support for Haskell

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

Types representing line and column positions and ranges in text files.

A simple multi-way tree data structure.