Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Interface for JavaScript that works with GHCJS and GHC This package provides an EDSL for calling JavaScript that can be used both from GHCJS and GHC. When using GHC the application is run using Warp and WebSockets to drive a small JavaScript helper.
-
Modern library for working with URIs Modern library for working with URIs.
-
Morpheus GraphQL Core Build GraphQL APIs with your favorite functional language!
-
Sampling function-based probability distributions. A simple probability distribution type, where distributions are characterized by sampling functions. This implementation is a thin layer over mwc-random, which handles RNG state-passing automatically by using a PrimMonad like IO or ST s under the hood. Examples Transform a distribution's support while leaving its density structure invariant:
-- uniform over [0, 1] to uniform over [1, 2] fmap succ uniform
Sequence distributions together using bind:-- a beta-binomial compound distribution beta 1 10 >>= binomial 10
Use do-notation to build complex joint distributions from composable, local conditionals:hierarchicalModel = do [c, d, e, f] <- replicateM 4 $ uniformR (1, 10) a <- gamma c d b <- gamma e f p <- beta a b n <- uniformR (5, 10) binomial n p
-
Quasiquoter for neat and simple multiline text interpolation Quasiquoter for producing Text values with support for a simple interpolation of input values. It removes the excessive indentation from the input and accurately manages the indentation of all lines of the interpolated variables.
-
Simple network sockets usage patterns. This module exports functions that abstract simple network socket usage patterns. See the changelog.md file in the source distribution to learn about any important changes between versions.
-
An experimental alternative hierarchy of numeric type classes The package provides an experimental alternative hierarchy of numeric type classes. The type classes are more oriented at mathematical structures and their methods come with laws that the instances must fulfill.
-
A numeric class hierarchy. This package provides alternative numeric classes over Prelude. The numeric class constellation looks somewhat like:
Usage
>>> {-# LANGUAGE GHC2024 #-} >>> {-# LANGUAGE RebindableSyntax #-} >>> import NumHask.PreludeSee NumHask for a detailed overview. -
Set- and Map-like types that remember the order elements were inserted Set- and Map-like types that remember the order elements were inserted
-
Classes and data structures for working with data-kind indexed types This package contains collection classes and type representations used for working with values that have a single parameter. It's intended for things like expression libraries where one wishes to leverage the Haskell type-checker to improve type-safety by encoding the object language type system into data kinds.