Haskell Data Structures

Agda is a dependently typed programming language / interactive theorem prover.

Dapp, Seth, Hevm, and more

checkers for algebra driven design

:ramen: A tasty Haskell front-end framework

Assorted concrete container types

Circular fixed-sized stacks

Fake dependent types in Haskell using singletons

A set of utilities for using indexed types including containers, equality, and comparison.

Generic strict finger-tree structure

Randomized Binary Search Trees (Martinez, and Roura, 1997)

Generic finger-tree structure, with example instances

Haskell graphs and networks library

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

A Haskell library for containers to extend the containers and unordered-containers packages.

Min-max priority queue, also known as double-ended priority queue.

A few variants of multimaps.

Ties the knot on data structures that reference each other by unique keys

♾️ Sized list

Dual Traversable

Lens instances for extended-containers.

Efficient non-empty variants of containers data types, with full API

Simple adjunctions

Haskell bidirectional arrows, bijective functions, and invariant functors

Simple, no-frills indexed lists.

Haskell data structure for maps and sets with partially ordered keys

Dependently typed elimination functions using singletons

A simple music library with the capability of generating .ly and .mid files.

More strongly typed variant of the ixset Haskell package

Haskell implementatio of R-Trees

Asymptotically optimal Brodal/Okasaki heaps

Types representing line and column positions and ranges in text files

colorful-monoids: Styled console text output using ANSI escape sequences

A Functional Graph Library for Haskell

ℹ️ Index-related functions for lists

An efficient graph library for Haskell

Haskell Package for operating with selections over an underlying functor

Syntax sugar and explicit semantics for statically defined maps

Provides Data.Void, which is in base since ghc 7.8 or so

A simple multi-way tree data structure

multiset haskell package

A purely functional ring data structure for Haskell.

Standard containers, with keys that carry type-level proofs of their own presence.

High performance, regular, shape polymorphic parallel arrays.

High performance, regular, shape polymorphic parallel arrays.

High performance, regular, shape polymorphic parallel arrays.

Memoize discrete functions (restricted to a finite domain) using arrays

A Haskell version of an Ethereum client

A modified Merkle Patricia DB

Ethereum Recursive Length Prefix Encoding

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

Type composition classes & instances & misc

Haskell implementation of the Edinburgh Logical Framework

Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.

Open type representations and dynamic types

A language based on homotopy type theory with an interval

Implementation of Univalence in Cubical Sets

An Ethereum contract analyzer.

Queues with verified and unverified versions

Conceptual modeling support library for Haskell

Prototypical type checker for Type Theory with Sized Natural Numbers

Efficient representable functors

Friendly helpers for your recursion schemes.

Perfect minimal hashing implementation in native Haskell

Types to support turning structured collections of seed values into the same structures with alternatives along with some functions for regular uses

Efficient alternating finger trees

A few more container types

A Data.Map wrapper with a Monoid instance that delegates to the individual keys

Convert between ByteString and Vector.Storable without copying

A monoid which counts changing values in a sequence

Poly Variadic Functions in Haskell

Código Haskell usado en el curso de I1M (Informática de 1º de Matemática)

NonEmpty Map Libary

Haskell implementation of the radix tree data structure

representable functors

Support for reasoning on Clafer models by instantiation and counter example generation.

Clafer is a lightweight modeling language

A plugin for GHC to support super monads.

Type-safe communication with USB devices

Extends safer-file-handles with Text operations

Extends safer-file-handles with ByteString operations

Type-safe file handling

Regional memory pointers

Monad transformers in CPS

A compact functional set data structure

Haskell library meant to be a set of tools to correct spelling mistakes, homophones, and OCR errors

Anonymous records and overloaded labels

Permissions for bookkeeper records

A backend agnostic, concurrent BTree written in Haskell

Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet

A mirror of DrIFT.

Edison: A Library of Efficient Data Structures

A redistribution of 'containers', with all hidden modules exposed.

DISCONTINUED. A purely functional and persistent hash map

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

Automatically exported from code.google.com/p/monoid-cont

Incomplete Haskell bindings to the igraph library (which is written in C)

A Set type which supports multiple indexes

Extensions to Data.Map

MArray instances for monad transformers

git import of patrick perry permutations lib from darcs