Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. package doctest-exitcode-stdio

    Run doctest's in a Cabal.Test.exitcode-stdio environment Run doctest's in a Cabal.Test.exitcode-stdio environment. For use with the doctest-extract utility. Normally, you should not need to import a module from this package, only generated code will do this.

  2. package doctest-lib

    Parts of doctest exposed as library Parts of doctest exposed as library. For use with the doctest-extract utility.

  3. package either

    Combinators for working with sums Combinators for working with sums.

  4. package explicit-exception

    Exceptions which are explicit in the type signature. Synchronous and Asynchronous exceptions which are explicit in the type signature. The first ones are very similar to Either and Control.Monad.Error.ErrorT. The second ones are used for System.IO.readFile and System.IO.hGetContents. This package is a proposal for improved exception handling in Haskell. It strictly separates between handling of exceptional situations (file not found, invalid user input, see http://wiki.haskell.org/Exception) and (programming) errors (division by zero, index out of range, see http://wiki.haskell.org/Error). Handling of the first one is called "exception handling", whereas handling of errors is better known as "debugging". For applications see the packages midi, spreadsheet, http-monad. Although I'm not happy with the identifier style of the Monad Transformer Library (partially intended for unqualified use) I have tried to adopt it for this library, in order to let Haskell programmers get accustomed easily to it. See also: unexceptionalio

  5. package extensible-exceptions

    Extensible exceptions This package provides extensible exceptions for both new and old versions of GHC (i.e., < 6.10).

  6. package genvalidity-criterion

    Criterion benchmarks for generators Criterion benchmarks for generators

  7. package hlint

    Source code suggestions HLint gives suggestions on how to improve your source code.

  8. package monad-loops

    Monadic loops Some useful control operators for looping. New in 0.4: STM loop operators have been split into a new package instead of being conditionally-built. New in 0.3.2.0: various functions for traversing lists and computing minima/maxima using arbitrary procedures to compare or score the elements.

  9. package network-bsd

    POSIX network database () API This package provides Haskell bindings to the the POSIX network database (netdb.h) API.

    Relationship to the network package

    The network package version 2.* series provides Network.BSD but it is removed starting with network version 3.0. This package provides the Network.BSD module split off from the network package. If in addition to the network's modules also Network.BSD is necessary, add network-bsd to your dependencies like so:
    library
    build-depends: network     >= 2.7 && < 3.2
    , network-bsd >= 2.7 && < 2.9
    
    I.e. you can control the version of the network package independently. NOTE: Starting with network-bsd-2.8.1.0 the APIs of network and network-bsd evolve differently, and consequently the versioning doesn't match up anymore! Moreover, also starting with version network-bsd-2.8.1.0 this package requires network >= 3 in order to avoid module name clashes with network < 3's Network.BSD module. However, network-bsd-2.7.0.0 and network-bsd-2.8.0.0 passes thru the Network.BSD module from network-2.7.* and network-2.8.* respectively in a non-clashing way via Cabal's reexported-modules feature while ensuring a well-defined API versioning of the observable API of network-bsd. This is why the example above supporting a wide range of network versions works by including version 2.7.0.0 in the required version range of network-bsd.

  10. package parser-combinators

    Lightweight package providing commonly useful parser combinators Lightweight package providing commonly useful parser combinators.

Page 22 of many | Previous | Next