Haskell Comonads

A lens-based implementation of protocol buffers in Haskell.

A Haskell implementation of MessagePack

A tiny lens library with no dependencies. If you're writing an app, ...

Extensible, efficient, optics-friendly data types

Fast binary serialization

Comonads

Semigroupoids

Kan extensions, Kan lifts, various forms of the Yoneda lemma, and (co)density (co)monads

A library for hex dumps of ByteStrings

First class accessor labels implemented as lenses.

Use Template Haskell to embed file contents directly.

Fast base64 encoding and decoding for ByteStrings

Fork of resource-pool, with a MonadCatchIO constraint

Various extra monoid-related definitions and utilities

ASN1 data reader and writer in RAW, BER and DER forms

Various Haskell 2010 stream comonads

Beautiful Folding

Category theory

QuasiQuoter for Perl6-style multi-line interpolated strings

Library for efficiently building up buffers, one piece at a time

A small library for parsing IRC messages.

Derive instances for your existential types.

Library for histograms creation.

Used to be Haskell 98 Lenses

Finitely represented /total/ maps

Extensible type-safe unions

Implementation of the OpenPGP message format

Bidirectional mapping between two key types

This package has been merged into comonad 4.0

Exotic comonad transformers

Serialize data to and from Yaml files (deprecated)

An adapter to convert attoparsec Parsers into blazing-fast Iteratees

This package has been merged into comonad 4.0

Parser for DWARF debug format.

HCL parsers and pretty-printers for the Haskell programming language.

Conduit interface for cassava package

Types representing standard and non-standard currencies

Scrap Your Boilerplate With Class

Program that infers the fastest data structure available for your program

Order statistic trees based on weight-balanced trees

Prettyprint and compare Data values

Tries from representations of polynomial functors

Haskell bindings to the libphonenumber library

Entity based records

A type inhabited by finitely many values, indexed by type-level naturals.

Lenses

Typeclasses for injective relations and isomorphisms between types.

Recursively manipulate and traverse filesystems as lazy rose trees.

Memory efficient sets with ranges of elements.

Functional concurrency with unamb using a custom scheduler.

Find the ideal lesson layout

Haskell values that cannot be evaluated immediately.