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.
-
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.
-
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. -
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.
-
Double-ended priority queues Double-ended priority queues, for efficient retrieval of minimum and maximum elements in ordered collections of items.
-
Derive type class instances This package will make it easier to derive class instance for complex composited data types by using Template Haskell.
-
Derive ToJSON/FromJSON instances in a more prefix-friendly manner. Please see the README on GitLab at https://gitlab.com/igrep/deriveJsonNoPrefix#readme
-
Braille diagrams with plain text Please see the README at https://github.com/diagrams/diagrams-braille#readme
-
hint-based build service for the diagrams graphics EDSL. diagrams-builder provides backend-agnostic tools for dynamically turning code into rendered diagrams, using the hint wrapper to the GHC API. It supports conditional recompilation using hashing of diagrams source code, to avoid recompiling code that has not changed. It is useful for creating tools which compile diagrams code embedded in other documents. For example, it is used by the BlogLiterately-diagrams package (a plugin for BlogLiterately) to compile diagrams embedded in Markdown-formatted blog posts. Executables specific to the cairo, SVG, postscript, and rasterific backends are included (more executables specific to other backends may be included in the future). All take an input file and an expression to render, and output an image file. If you want these executables you must explicitly enable the -fcairo, -fsvg, -fpostscript, or -frasterific flags. A LaTeX package, diagrams-latex.sty, is also provided in the latex/ directory of the source distribution, which renders diagrams code found within diagram environments. Note that diagrams-latex.sty is licensed under the GPL.
-
Sharing/memoization of class members Library for ensuring that class members are shared.