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'

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.

@pipes-group@ uses @FreeT@ and lenses to group streams into sub-streams. Notable features include: . * /Perfect Streaming/: Group elements without collecting them into memory . * /Lens Support/: Use lenses to simplify many common operations . @Pipes.Group@ contains the full documentation for this library. . Read @Pipes.Group.Tutorial@ for an extensive tutorial.

Orphan instances for TH datatypes. In particular, instances for Ord and Lift, as well as a few missing Show / Eq. These instances used to live in haskell-src-meta, and that's where the version number started.

Bindings for Gdk, autogenerated by haskell-gi.

This library provides common functions and values used for testing SMT-LIB backends, as provided by the smtlib-backends library.

This library provides an extensible interface for interacting with SMT solvers using SMT-LIB. The smtlib-backends-process package provides a backend that runs solvers as external processes, and the smtlib-backends-z3 package provides a backend that uses inlined calls to Z3's C API.

This package provides various primitive memory-related operations.

@th-reify-many@ provides functions for recursively reifying top level declarations. The main intended use case is for enumerating the names of datatypes reachable from an initial datatype, and passing these names to some function which generates instances.

Bindings to libzfs, for dealing with the Z File System and Zpools.

Bindings for GObject, autogenerated by haskell-gi.

This package gives you access to the set of operating system services standardised by <http://pubs.opengroup.org/onlinepubs/9699919799/ POSIX.1-2008> (or the IEEE Portable Operating System Interface for Computing Environments - IEEE Std. 1003.1). . The package is not supported under Windows.

Bindings for Gtk, autogenerated by haskell-gi.

REST is a Rewriting library with online termination checking. For more details see the paper at https://arxiv.org/abs/2202.05872.

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.

Please see the README on Github at <https://github.com/IvanMalison/status-notifier-item#readme>

Bindings for libdbusgtk3, autogenerated by haskell-gi.

Generate Haskell bindings for GObject Introspection capable libraries. This includes most notably Gtk+, but many other libraries in the GObject ecosystem provide introspection data too.

Bindings for Atk, autogenerated by haskell-gi.

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

Please see the README on Github at <https://github.com/IvanMalison/gtk-sni-tray#readme>

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 practical incremental and one-pass, pure API to the <https://en.wikipedia.org/wiki/SHA-1 SHA-1 hash algorithm> (including <https://en.wikipedia.org/wiki/HMAC HMAC> support) with performance close to the fastest implementations available in other languages. . The implementation is made in C with a haskell FFI wrapper that hides the C implementation. . NOTE: This package has been forked off @cryptohash-0.11.7@ because the @cryptohash@ package has been deprecated and so this package continues to satisfy the need for a lightweight package providing the SHA1 hash algorithm without any dependencies on packages other than @base@ and @bytestring@. . Consequently, this package can be used as a drop-in replacement for @cryptohash@'s "Crypto.Hash.SHA1" module, though with a clearly smaller footprint.