This package defines symbol and emoji codes for the typst language (<https://typst.app>).

Lets multiple threads and external processes concurrently output to the console, without it getting all garbled up.

Built on top of that is a way of defining multiple output regions, which are automatically laid out on the screen and can be individually updated by concurrent threads. Can be used for progress displays etc.

This library provides extensible optionally-pure exceptions for Haskell.

This package provides optimized functions to determine the edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.

This package provides a Haskell type inhabited by finitely many values and indexed by type-level naturals.

This library provides a fast logging system for Haskell.

This package provides helper functions for working with haskell-src-exts trees.

This package endows Data.Time, from the time package, with several data types and functions for enhanced processing of timezones. For one way to create timezone series, see the ghc-timezone-olson package.

Shelly provides convenient systems programming in Haskell, similar in spirit to POSIX shells. Shelly is originally forked from the Shellish package.

This package provides a Haskell wrapper over the LibYAML C library.

Haskeline wrapper for GHCi-like REPL interfaces. Composable with normal mtl transformers.

Parsing of aeson's Value with attoparsec, originally from aeson.

FoldMap lists are lists represented by their foldMap function. FoldMap lists have O(1) cons, snoc and append, just like DLists, but other operations might have favorable performance characteristics as well. These wild claims are still completely unverified though.

This library provides functions for use in parsing indentation sensitive contexts. It parses blocks of lines all indented to the same level as well as lines continued at an indented level below.

In Haskell you very often acquire values using the with... idiom using functions of type (a -> IO r) -> IO r. This idiom forms a Monad, which is a special case of the ContT monad (from transformers) or the Codensity monad (from kan-extensions). The main purpose behind this package is to provide a restricted form of these monads specialized to this unusually common case.

The reason this package defines a specialized version of these types is to:

• be more beginner-friendly,

• simplify inferred types and error messages, and:

• provide some additional type class instances that would otherwise be orphan instances

This Haskell package includes a thin sqlite3 wrapper based on the direct-sqlite package, as well as the entire C library, so there are no system dependencies.

Atomically write to a file on POSIX-compliant systems while preserving permissions. mv is an atomic operation. This makes it simple to write to a file atomically just by using the mv operation. However, this will destroy the permissions on the original file. This library preserves permissions while atomically writing to a file.

This package provides Haskell bindings to SDL2_image.

This library provides a framework for size-based enumerations.

This package contains bindings to the SDL 2 library, in both high- and low-level forms. The SDL namespace contains high-level bindings, where enumerations are split into sum types, and we perform automatic error-checking. The SDL.Raw namespace contains an almost 1-1 translation of the C API into Haskell FFI calls. As such, this does not contain sum types nor error checking. Thus this namespace is suitable for building your own abstraction over SDL, but is not recommended for day-to-day programming.

This module allows tokens produced by skylighting-core to be rendered as LaTeX macros.

A library for generating concise pretty printers based on precedence rules.

Happy is a parser generator for Haskell. Given a grammar specification in BNF, Happy generates Haskell code to parse the grammar. Happy works in a similar way to the yacc tool for C.

This package provides Haskell 98 groups. A group is a monoid with invertibility.