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, ...

Fast binary serialization

Extensible, efficient, optics-friendly data types

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

A library for hex dumps of ByteStrings

Semigroupoids

Comonads

First class accessor labels implemented as lenses.

Use Template Haskell to embed file contents directly.

Fork of resource-pool, with a MonadCatchIO constraint

Fast base64 encoding and decoding for ByteStrings

Various extra monoid-related definitions and utilities

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

Various Haskell 2010 stream comonads

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

Beautiful Folding

A small library for parsing IRC messages.

QuasiQuoter for Perl6-style multi-line interpolated strings

Category theory

Derive instances for your existential types.

Used to be Haskell 98 Lenses

Library for histograms creation.

Implementation of the OpenPGP message format

Finitely represented /total/ maps

This package has been merged into comonad 4.0

Bidirectional mapping between two key types

Extensible type-safe unions

Exotic comonad transformers

An adapter to convert attoparsec Parsers into blazing-fast Iteratees

Serialize data to and from Yaml files (deprecated)

This package has been merged into comonad 4.0

Types representing standard and non-standard currencies

Scrap Your Boilerplate With Class

Conduit interface for cassava package

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

Prettyprint and compare Data values

Program that infers the fastest data structure available for your program

Tries from representations of polynomial functors

Parser for DWARF debug format.

Order statistic trees based on weight-balanced trees

Entity based records

Haskell bindings to the libphonenumber library

Recursively manipulate and traverse filesystems as lazy rose trees.

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

Typeclasses for injective relations and isomorphisms between types.

Lenses

Memory efficient sets with ranges of elements.

Functional concurrency with unamb using a custom scheduler.

Haskell values that cannot be evaluated immediately.

Find the ideal lesson layout