Michael and Scott queues are described in their PODC 1996 paper: . <http://dl.acm.org/citation.cfm?id=248052.248106> . These are single-ended concurrent queues based on a singlly linked list and using atomic CAS instructions to swap the tail pointers. As a well-known efficient algorithm they became the basis for Java's @ConcurrentLinkedQueue@.

For upgrading to streamly-0.9.0+ please read the <https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/Upgrading-0.8-to-0.9.md Streamly-0.9.0 upgrade guide>. . Streamly is a standard library for Haskell that focuses on C-like performance, modular combinators, and streaming data flow model. Streamly consists of two packages, the <https://hackage.haskell.org/package/streamly-core streamly-core> package provides functionality that depends only on boot libraries, and the <https://hackage.haskell.org/package/streamly streamly> package provides additional functionality like concurrency, time, lifted exceptions, and networking. For unified documentation visit <https://streamly.composewell.com the streamly website>. . Streamly provides unified, modular building blocks to build high-performance, concurrent, scalable applications in Haskell . Stream fusion optimizations in streamly enable exceptional modularity with high performance comparable to C. Streamly complements the Haskell <https://hackage.haskell.org/package/base base> package, supplying additional functionality to quickly build general-purpose applications in Haskell. For high-level functionality built over streamly like streaming OS processes, shell programming, GNU coreutils, statistics, and compression libraries please see the <https://streamly.composewell.com/ecosystem.html streamly ecosystem packages>. . Performance with modularity: . * Performance on par with C (<https://github.com/composewell/streaming-benchmarks Benchmarks>) * API close to standard Haskell lists (<https://github.com/composewell/streamly-examples Examples>) * Declarative concurrency with automatic scaling * Filesystem, fsnotify, network, and Unicode support included * Fast binary serialization (with optional JSON like features) * More functionality is provided via many (<https://streamly.composewell.com/ecosystem.html ecosystem packages>) . Unified and powerful abstractions: . * Unifies streams, arrays, folds, and parsers * Unifies @Data.List@, @list-t@, and @logict@ with streaming * Unifies concurrency with standard streaming abstractions * Unifies reactive, time-domain programming with streaming * Unifies binary serialization and unboxed arrays * Interworks with other streaming libraries.

Bindings for GObject, autogenerated by haskell-gi.

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

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

Haskell bindings for libarchive. Provides the ability to unpack archives, including the ability to unpack archives lazily.

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.

This package provides tests that can be used with any queue implementation that satisfies the `abstract-deque` interface.

Bindings for Graphene, autogenerated by haskell-gi.

This package provides portable implementations of parts of the unix package. This package re-exports the unix package when available. When it isn't available, portable implementations are used.

Tasty is a modern testing framework for Haskell. It lets you combine your unit tests, golden tests, QuickCheck/SmallCheck properties, and any other types of tests into a single test suite.

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

Various useful functions on tuples, overloaded on tuple size.

Efficient hash-consing for arbitrary data types.

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

This package normalizes variations in the interface for inspecting datatype information via Template Haskell so that packages and support a single, easier to use informational datatype while supporting many versions of Template Haskell.

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

This library provides an interface to portably work with byte arrays whose contents are known to be of a fixed endianness. There are two ways to use this module. See the `System.ByteOrder` module for more documentation.

Please see the README on Github at <https://github.com/IvanMalison/dbus-hslogger#readme>

Bindings for GdkPixbuf, autogenerated by haskell-gi.

QuickCheck is a library for random testing of program properties. The programmer provides a specification of the program, in the form of properties which functions should satisfy, and QuickCheck then tests that the properties hold in a large number of randomly generated cases. Specifications are expressed in Haskell, using combinators provided by QuickCheck. QuickCheck provides combinators to define properties, observe the distribution of test data, and define test data generators. . Most of QuickCheck's functionality is exported by the main "Test.QuickCheck" module. The main exception is the monadic property testing library in "Test.QuickCheck.Monadic". . If you are new to QuickCheck, you can try looking at the following resources: . * The <http://www.cse.chalmers.se/~rjmh/QuickCheck/manual.html official QuickCheck manual>. It's a bit out-of-date in some details and doesn't cover newer QuickCheck features, but is still full of good advice. * <https://begriffs.com/posts/2017-01-14-design-use-quickcheck.html>, a detailed tutorial written by a user of QuickCheck. . The <https://hackage.haskell.org/package/quickcheck-instances quickcheck-instances> companion package provides instances for types in Haskell Platform packages at the cost of additional dependencies.

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

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