Parser and writer for handling sectioned config files in Haskell. . The ConfigFile module works with configuration files in a standard format that is easy for the user to edit, easy for the programmer to work with, yet remains powerful and flexible. It is inspired by, and compatible with, Python's ConfigParser module. It uses files that resemble Windows .INI-style files, but with numerous improvements. . ConfigFile provides simple calls to both read and write config files. It's possible to make a config file parsable by this module, the Unix shell, and make.

Time, clocks and calendars.

As of 2023, this library is largely obsolete: arbitrary test generators with shrinking such as [falsify](https://hackage.haskell.org/package/falsify) offer much better user experience. . SmallCheck is a testing library that allows to verify properties for all test cases up to some depth. The test cases are generated automatically by SmallCheck.

Dyre implements dynamic reconfiguration facilities after the style of Xmonad. Dyre aims to be as simple as possible without sacrificing features, and places an emphasis on simplicity of integration with an application. A full introduction with a complete example project can be found in the documentation for 'Config.Dyre'

Included are some folds and maps I've found useful in parsing XML data.

This package provides a stable version of Hspec which is used to test the in-development version of Hspec.

GHC package that provides types that when used in a package can be identified by the <https://hackage.haskell.org/package/fusion-plugin fusion-plugin> package to perform any extra optimizations.

This package implements an SMTLIB based Horn-Clause\/Logical Implication constraint solver used for Liquid Types. . The package includes: . 1. Types for Expressions, Predicates, Constraints, Solutions 2. Code for solving constraints . Requirements . In addition to the .cabal dependencies you require . * A Z3 (<http://z3.codeplex.com>) or CVC4 (<http://cvc4.cs.nyu.edu>) binary.

This package provides a pure interface for compressing and decompressing LZMA (Lempel&#8211;Ziv&#8211;Markov chain algorithm) streams of data represented as lazy ByteStrings. A monadic incremental interface is provided as well. This package relies on the liblzma C library.

Bindings for Gtk, autogenerated by haskell-gi.

Bindings for freetype2, autogenerated by haskell-gi.

Catchy combinators for HUnit: <https://github.com/hspec/hspec-expectations#readme>.

Derive Template Haskell's @Lift@ class for datatypes using @TemplateHaskell@. The functionality in this package has largely been subsumed by the @DeriveLift@ language extension, which is available in GHC 8.0 and later versions. As such, this package is only useful as a way to backport bugfixes to @DeriveLift@ in later GHC versions back to older GHCs. . The following libraries are related: . * The <https://hackage.haskell.org/package/th-orphans th-orphans> package provides instances for @template-haskell@ syntax types. . * The <http://hackage.haskell.org/package/th-lift-instances th-lift-instances> package provides @Lift@ instances for types in @base@, @text@, @bytestring@, @vector@, etc. Some of these instances are only provided for old versions of their respective libraries, as the same @Lift@ instances are also present upstream on newer versions.

Bindings for Pango, autogenerated by haskell-gi.

Haskell WebKit bindings.

In many cases, it is useful, necessary, or simply nice to limit how frequently you perform some action. For example, you may want to limit how often your program makes a request of some web site. This library is intended as a general-purpose mechanism for rate-limiting IO actions.

Many recursive functions share the same structure, e.g. pattern-match on the input and, depending on the data constructor, either recur on a smaller input or terminate the recursion with the base case. Another one: start with a seed value, use it to produce the first element of an infinite list, and recur on a modified seed in order to produce the rest of the list. Such a structure is called a recursion scheme. Using higher-order functions to implement those recursion schemes makes your code clearer, faster, and safer. See README for details.

Unaligned access to primitive arrays. The offsets are given in bytes rather than elements.

A wrapper for gi-gtk, adding a few more idiomatic API parts on top

This library provides tools for reading and manipulating the .cabal file format.

This package lacks a description. Run "info '(guix) Synopses and Descriptions'" for more information.

This library defines an Interpreter monad. It allows to load Haskell modules, browse them, type-check and evaluate strings with Haskell expressions and even coerce them into values. The library is thread-safe and type-safe (even the coercion of expressions to values). It is, essentially, a huge subset of the GHC API wrapped in a simpler API.

Cairo is a library to render high quality vector graphics. There exist various backends that allows rendering to Gtk windows, PDF, PS, PNG and SVG documents, amongst others.

Use this library to read large directories as streams: . * Use @ListT@ to assemble recursive directory traversals while still streaming . * Use @pipes@ to read out the stream of results . * Traversals only open directory streams lazily in response to demand . * Avoid directories with insufficient permissions . This library works on both Unix and Windows.