Haskell implemented with combinators

DEPRECATED in favor of ghc wasm backend, see https://www.tweag.io/blog/2022-11-22-wasm-backend-merged-in-ghc

Utility functions for Coercible types

Data frames for tabular data.

Derive instances through isomorphisms

Extensional capabilities and deriving combinators

Composable, streaming, and efficient left folds

This package provides various primitive memory-related operations.

A simple expressions language with polymorphic extensible row types.

machine fusion

Zippers based on lenses and traversals

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

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

Folds and sequence algebras

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

Low-dimensional linear algebra primitives for Haskell.

Official Haskell IDE support via the language server protocol (LSP)

An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .

Efficient Haskell Arrays featuring Parallel computation

Proposed compiler and language changes for GHC and GHC/Haskell

GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.

Inspection Testing for Haskell

Happy Haskell Hacking for editors. DEPRECATED

Generically derive traversals, lenses, and prisms.

Sort any Traversable container

Anonymous extensible records and variant types

Binary serialisation in the CBOR format

lazy bytestrings from `bytestring-mmap` replaced by `Producer ByteString IO ()`