Edward Kmett

lens. Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens

ad. Automatic Differentiation

machines. Networks of composable stream transducers

trifecta. Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink

guanxi. Relational programming in Haskell. Mostly developed on twitch.

linear. Low-dimensional linear algebra primitives for Haskell.

quine. haskell, opengl, toy project

free. free monads

propagators. The Art of the Propagator. See also:

hask. Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)

coda. A language experiment -- irc.freenode.net ##coda

discrimination. Fast linear time sorting and discrimination for a large class of data types

bound. Combinators for manipulating locally-nameless generalized de Bruijn terms

algebra. constructive abstract algebra

reflection. Reifies arbitrary Haskell terms into types that can be reflected back into terms

succinct. playground for working with succinct data structures

gl. Complete raw OpenGL bindings for Haskell

parsers. Generic parser combinators

linear-logic. They see me rollin'. They're Heyting. -- Chamillionaire, 2005

kan-extensions. Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor

comonad. Haskell 98 comonads

tables. Deprecated because of

semigroupoids. Haskell

constraints. Tools for programming with ConstraintKinds in GHC

contravariant. Haskell 98 contravariant functors

profunctors. Haskell 98 Profunctors

approximate. Approximate discrete values and numbers

cadenza. every day i'm truffling

codex. UI experiments for coda

structures. A playground for working on advanced data structures in Haskell

ersatz. A monad for interfacing with external SAT solvers

semigroups. Haskell 98 semigroups

either. the EitherT monad transformer

bifunctors. Haskell 98 bifunctors, bifoldables and bitraversables

exceptions. mtl friendly exceptions

unpacked-containers. Unpacked containers using backpack

structs. Exploring how to make a strict imperative universe in the GHC runtime system.

reducers. Semigroups, specialized containers and a general map/reduce framework

adjunctions. Simple adjunctions

distributive. Dual Traversable

tagged. phantom types

auth. Haskell

graphs. a monadic graph library

zippers. Zippers based on lenses and traversals

unboxed. experimenting with unlifted classes via backpack

rounded. MPFR bindings for Haskell

heaps. Asymptotically optimal Brodal/Okasaki heaps

perhaps. A monad, perhaps.

rts. spmd-on-simd stuff

intervals. Interval Arithmetic

magpie. an exploration of subtyping-based category theory in scala

sparse. sparse matrices in Morton order