Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

package data-prometheus

Prometheus metrics text format Pure Prometheus metrics text data parser and builder
package data-ref

Unify STRef and IORef in plain Haskell 98 This package provides a unique interface to both STRef and IORef. The advantage is that it is plain Haskell 98, the disadvantage is that we cannot use STRef and IORef as they are. Our approach works with Haskell 98 single parameter type classes because we use an explicit dictionary, and we do not pass the references around but their accessors. Similar packages: reference, ref-mtl, ref-fd, ref-tf.
package dataurl

Handle data-urls Please see README.md
package debian-build

Debian package build sequence tools This package provides build sequence functions for debian package, and includes on-the-fly build command odebuild.
package decidable

Combinators for manipulating dependently-typed predicates. This library provides combinators and typeclasses for working and manipulating type-level predicates in Haskell, which are represented as matchable type-level functions k ~> Type from the singletons library. See Data.Type.Predicate for a good starting point, and the documentation for Predicate on how to define predicates.
package declarative

DIY Markov Chains. This package presents a simple combinator language for Markov transition operators that are useful in MCMC. Any transition operators sharing the same stationary distribution and obeying the Markov and reversibility properties can be combined in a couple of ways, such that the resulting operator preserves the stationary distribution and desirable properties amenable for MCMC. We can deterministically concatenate operators end-to-end, or sample from a collection of them according to some probability distribution. See Geyer, 2005 for details. A useful strategy is to hedge one's 'sampling risk' by occasionally interleaving a computationally-expensive transition (such as a gradient-based algorithm like Hamiltonian Monte Carlo or NUTS) with cheap Metropolis transitions.
```
transition = frequency [
(9, metropolis 1.0)
, (1, hamiltonian 0.05 20)
]
```
Alternatively: sample consecutively using the same algorithm, but over a range of different proposal distributions.
```
transition = concatAllT [
slice 0.5
, slice 1.0
, slice 2.0
]
```
Or just mix and match and see what happens!
```
transition =
sampleT
(sampleT (metropolis 0.5) (slice 0.1))
(sampleT (hamiltonian 0.01 20) (metropolis 2.0))
```
Check the test suite for example usage.
package delta-types

Delta types, also known as change actions. A delta type da for a base type a is a collection of values, each of which corresponds to a change a → a of the base type. See also
- Delta encodings help separate business logic from database operations
- Fixing Incremental Computation: Derivatives of Fixpoints, and the Recursive Semantics of Datalog (Here, the concept of a delta type is called a change action.)
package dependent-monoidal-map

Dependent map that uses semigroup mappend Data.Dependent.Map variant that appends conflicting entries when merging maps instead of discarding one side of the conflict.
package depq

Double-ended priority queues Double-ended priority queues, for efficient retrieval of minimum and maximum elements in ordered collections of items.
package derive-topdown

Derive type class instances This package will make it easier to derive class instance for complex composited data types by using Template Haskell.

Page 177 of many | Previous | Next