ekmett/discrimination

Stars
134
Rank 270,967 (Top 6 %)
Language
Haskell
License
Other
Created almost 10 years ago
Updated 9 months ago

ekmett/discrimination

ekmett

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

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

discrimination

This package provides linear time sorting, partitioning, and joins for a wide array of Haskell data types. This work is based on a "final encoding" of the ideas presented in multiple papers and talks by Fritz Henglein.

By adopting a final encoding we can enjoy many instances for standard classes, lawfully, without quotienting.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

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

quine

haskell, opengl, toy project

linear

Low-dimensional linear algebra primitives for Haskell.

propagators

The Art of the Propagator. See also:

coda

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

free

hask

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

bound

Combinators for manipulating locally-nameless generalized de Bruijn terms

reflection

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

algebra

constructive abstract algebra

succinct

playground for working with succinct data structures

gl

Complete raw OpenGL bindings for Haskell

parsers

Generic parser combinators

linear-logic

comonad

Haskell 98 comonads

tables

Deprecated because of

semigroupoids

kan-extensions

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

contravariant

Haskell 98 contravariant functors

constraints

Tools for programming with ConstraintKinds in GHC

profunctors

Haskell 98 Profunctors

cadenza

every day i'm truffling

codex

UI experiments for coda

approximate

Approximate discrete values and numbers

structures

A playground for working on advanced data structures in Haskell

ersatz

A monad for interfacing with external SAT solvers

semigroups

Haskell 98 semigroups

bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables

either

the EitherT monad transformer

unpacked-containers

Unpacked containers using backpack

exceptions

mtl friendly exceptions

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

auth

distributive

Dual Traversable

graphs

a monadic graph library

zippers

Zippers based on lenses and traversals

tagged

unboxed

experimenting with unlifted classes via backpack

perhaps

A monad, perhaps.

rounded

MPFR bindings for Haskell

hyphenation

Knuth-Liang Hyphenation for Haskell based on TeX hyphenation files

categories

categories from category-extras

transients

Clojure-style transients for Haskell

concurrent

Yet another concurrent playground

abelian

Commutative Applicatives and Semigroups

hkd

higher-kinded data

speculation

Safe, programmable, speculative evaluation for Haskell

rts

spmd-on-simd stuff

placeholder

todo and unimplemented, robustly implemented

promises

intervals

Interval Arithmetic

heaps

Asymptotically optimal Brodal/Okasaki heaps

intern

Hash consing for arbitrary Haskell data types

hyperloglog

A constant-memory approximation of set membership

magpie

an exploration of subtyping-based category theory in scala

lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

sparse

sparse matrices in Morton order

indexed

Indexed Functors for GHC 7.6

streams

Haskell 2010 stream comonads

keys

bytes

Serialization primitives that work with both cereal and binary.

pointed

pointed and copointed data

scala-ad

Forward- and Reverse-Mode Automatic Differentiation for Scala

vr

nothing to see here

name

nominal sets in haskell

rope

Fingertrees of Bytestrings

jitplusplus

a tracing jit for c++ based on tracing and compiling from x86-64 assembly to x86-64 assembly

void

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

scheme-monads

minimalist polymorphic scheme-(co)monads, written to avoid use of any advanced language features except hygienic macros

fractions

lazy continued fractions

parsnip

folds

Folds and sequence algebras

concurrent-supply

A fast globally unique variable supply with a pure API

category-extras

category-theoretic goodness for Haskell

thc

An experimental "Turbo" Haskell Runtime - Nothing really to see here yet

lens-action

Control.Lens.Action

bad

a playground for working with fully static tensors and automatic differentiation

homotopy

rcu

experimenting with STM-backed read-copy-update in Haskell

multicategories

Playing around with multicategories and operads

gc

Poor Richard's Memory Manager

scala-attoparsec

A port of Bryan O'Sullivan's attoparsec from Haskell to Scala

kanso

just a place to throw some coding experiements while i re-re-re-learn rust

hyperfunctions

playing with hyperfunctions

succinct-binary

Succinct binary serialization

half

half-precision floating-point

time-series

Playing with time series

codebruijn

experiments with pext/pdep and codebruijn syntax

haskell

An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.

keep

playing with resumable computations

compensated

Compensated floating-point arithmetic

eq

Leibnizian type equality

nbe-in-java-19

a throwaway implementation of normalization by evaluation

bits

Bit twiddling and bitwise serialization primitives