Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. package singletons

    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.

  2. package some

    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.

  3. package sop-core

    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:

  4. package th-compat

    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.

  5. package time-locale-compat

    Compatibile module for time-format locale This package contains wrapped name module for time-format locale between old-locale and time-1.5.

  6. package constraints-extras

    Utility package for constraints Convenience functions and TH for working with constraints. See README.md for example usage.

  7. package cryptohash

    collection of crypto hashes, fast, pure and practical DEPRECATED: this library is still fully functional, but please use cryptonite for new projects and convert old one to use cryptonite. This is where things are at nowadays. A collection of crypto hashes, with a practical incremental and one-pass, pure APIs, with performance close to the fastest implementations available in other languages. The implementations are made in C with a haskell FFI wrapper that hide the C implementation. Simple examples using the unified API:

    import Crypto.Hash
    
    sha1 :: ByteString -> Digest SHA1
    sha1 = hash
    
    hexSha3_512 :: ByteString -> String
    hexSha3_512 bs = show (hash bs :: Digest SHA3_512)
    
    Simple examples using the module API:
    import qualified Crypto.Hash.SHA1 as SHA1
    
    main = putStrLn $ show $ SHA1.hash (Data.ByteString.pack [0..255])
    
    import qualified Crypto.Hash.SHA3 as SHA3
    
    main = putStrLn $ show $ digest
    where digest = SHA3.finalize ctx
    ctx    = foldl' SHA3.update iCtx (map Data.ByteString.pack [ [1,2,3], [4,5,6] ]
    iCtx   = SHA3.init 224
    

  8. package dependent-map

    Dependent finite maps (partial dependent products) Provides a type called DMap which generalizes Data.Map.Map, allowing keys to specify the type of value that can be associated with them.

  9. package fgl

    Martin Erwig's Functional Graph Library An inductive representation of manipulating graph data structures. Original website can be found at http://web.engr.oregonstate.edu/~erwig/fgl/haskell.

  10. package generics-sop

    Generic Programming using True Sums of Products A library to support the definition of generic functions. Datatypes are viewed in a uniform, structured way: the choice between constructors is represented using an n-ary sum, and the arguments of each constructor are represented using an n-ary product. The module Generics.SOP is the main module of this library and contains more detailed documentation. Since version 0.4.0.0, this package is now based on sop-core. The core package contains all the functionality of n-ary sums and products, whereas this package provides the datatype-generic programming support on top. Examples of using this library are provided by the following packages:

    A detailed description of the ideas behind this library is provided by the paper:

Page 28 of many | Previous | Next