Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Random shuffle implementation. Random shuffle implementation, on immutable lists. Based on `perfect shuffle' implementation by Oleg Kiselyov, available on http://okmij.org/ftp/Haskell/perfect-shuffle.txt
-
Selective applicative functors Selective applicative functors: declare your effects statically, select which to execute dynamically. This is a library for selective applicative functors, or just selective functors for short, an abstraction between applicative functors and monads, introduced in this paper.
-
Align and Zip type-classes from the common Semialign ancestor. The major use of These of this is provided by the align member of Semialign class, representing a generalized notion of "zipping with padding" that combines structures without truncating to the size of the smaller input. It turns out that zip operation fits well the Semialign class, forming lattice-like structure.
-
Basic singleton types and definitions singletons contains the basic types and definitions needed to support dependently typed programming techniques in Haskell. This library was originally presented in Dependently Typed Programming with Singletons, published at the Haskell Symposium, 2012. (https://richarde.dev/papers/2012/singletons/paper.pdf) singletons is intended to be a small, foundational library on which other projects can build. As such, singletons has a minimal dependency footprint and supports GHCs dating back to GHC 8.0. For more information, consult the singletons README. You may also be interested in the following related libraries:
- The singletons-th library defines Template Haskell functionality that allows promotion of term-level functions to type-level equivalents and singling functions to dependently typed equivalents.
- The singletons-base library uses singletons-th to define promoted and singled functions from the base library, including the Prelude.
-
Existential type: Some This library defines an existential type Some.
data Some f where Some :: f a -> Some f
in few variants, and utilities to work with it. If you are unsure which variant to use, use the one in Data.Some module. -
True Sums of Products Implementation of n-ary sums and n-ary products. The module Data.SOP is the main module of this library and contains more detailed documentation. The main use case of this package is to serve as the core of generics-sop. A detailed description of the ideas behind this library is provided by the paper:
- Edsko de Vries and Andres Löh. True Sums of Products. Workshop on Generic Programming (WGP) 2014.
-
Backward- (and forward-)compatible Quote and Code types This package defines a Language.Haskell.TH.Syntax.Compat module, which backports the Quote and Code types to work across a wide range of template-haskell versions. The makeRelativeToProject utility is also backported. On recent versions of template-haskell (2.17.0.0 or later), this module simply reexports definitions from Language.Haskell.TH.Syntax. Refer to the Haddocks for Language.Haskell.TH.Syntax.Compat for examples of how to use this module.
-
Compatibile module for time-format locale This package contains wrapped name module for time-format locale between old-locale and time-1.5.
-
Singleton Tuple This package is a compatibility package for a singleton data type
data Solo a = MkSolo a
Note: it's not a newtype Solo is available in base-4.16 (GHC-9.2). -
Utility package for constraints Convenience functions and TH for working with constraints. See README.md for example usage.