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 ulid

Implementation of ULID - Universally Unique Lexicographically Sortable Identifier Implementation of Alizain Feerasta's ULID specification. A 26 character string identifier, as opposed to the 36 character UUID string. Uses Douglas Crockford's base 32 encoding for better efficiency and readability (5 bits per character).
package unbound-generics

Support for programming with names and binders using GHC Generics Specify the binding structure of your data type with an expressive set of type combinators, and unbound-generics handles the rest! Automatically derives alpha-equivalence, free variable calculation, capture-avoiding substitution, and more. See Unbound.Generics.LocallyNameless to get started. This is an independent re-implementation of Unbound but using GHC.Generics instead of RepLib. See the accompanying README for some porting notes.
package unboxed-ref

Fast unboxed references for ST and IO monad Fast unboxed references for ST and IO monad
package unboxing-vector

A newtype-friendly variant of unboxed vectors Please see the README on GitHub at https://github.com/minoki/unboxing-vector#readme
package uncaught-exception

Customize uncaught exception handling. See README.md for details.
package unexceptionalio

IO without any non-error, synchronous exceptions When you've caught all the exceptions that can be handled safely, this is what you're left with. It is intended that you use qualified imports with this library.
```
import UnexceptionalIO (UIO)
import qualified UnexceptionalIO as UIO
```
You may also wish to investigate unexceptionalio-trans if you like monad transformers. Blog post: http://sngpl.ma/p4uT0
package union

Extensible type-safe unions Extensible type-safe unions for Haskell with prisms using modern GHC features. Dual to vinyl records. Unions are also known as corecords or polymorphic variants. Neither requires a Typeable constraint nor uses unsafe coercions at the cost of linear time access (negligible in practice).
package unique-logic

Solve simple simultaneous equations Solve a number of equations simultaneously. This is not Computer Algebra, better think of a kind of type inference algorithm or logic programming with only one allowed solution. Only one solution is computed. Simultaneous equations with multiple solutions are not allowed. However, variables may remain undefined. The solver may optionally check for consistency. It does not do so by default since with floating point numbers or symbolic expressions even simple rules may not be consistent. The modules ordered with respect to abstraction level are:
- UniqueLogic.ST.System: Construct and solve sets of functional dependencies. Example: assignment3 (+) a b c meaning dependency a+b -> c.
- UniqueLogic.ST.Rule: Combine functional dependencies to rules that can apply in multiple directions. Example: add a b c means relation a+b = c which resolves to dependencies a+b -> c, c-a -> b, c-b -> a. For an executable example see UniqueLogic.ST.Example.Rule.
- UniqueLogic.ST.Expression: Allows to write rules using arithmetic operators. It creates temporary variables automatically. Example: (a+b)*c =:= d resolves to a+b = x, x*c = d. For an executable example see UniqueLogic.ST.Example.Expression.
- UniqueLogic.ST.System.Simple: Provides specialised functions from UniqueLogic.ST.System for the case of a system without labels and consistency checks.
- UniqueLogic.ST.System.Label: Provides a custom constructor for variables. When creating a variable you decide whether and how an assignment to this variable shall be logged. There is an example that shows how to solve a logic system using symbolic expressions. The naming and logging allows us to observe shared intermediate results. For an executable example see UniqueLogic.ST.Example.Label.
- By using more sophisticated monad transformers, we can check the equations for consistency, report inconsistencies and how they arised. We demonstrate that in UniqueLogic.ST.Example.Verify.
The package is purely Haskell 98.
package unique-logic-tf

Solve simple simultaneous equations Solve a number of equations simultaneously. This is not Computer Algebra, better think of a kind of type inference algorithm or logic programming with only one allowed solution. Only one solution is computed. Simultaneous equations with multiple solutions are not allowed. However, variables may remain undefined. The solver may optionally check for consistency. It does not do so by default since with floating point numbers or symbolic expressions even simple rules may not be consistent. The modules ordered with respect to abstraction level are:
- UniqueLogic.ST.TF.System: Construct and solve sets of functional dependencies. Example: assignment3 (+) a b c means dependency a+b -> c.
- UniqueLogic.ST.TF.Rule: Combine functional dependencies to rules that can apply in multiple directions. Example: add a b c means relation a+b = c which resolves to dependencies a+b -> c, c-a -> b, c-b -> a. For an executable example see UniqueLogic.ST.TF.Example.Rule.
- UniqueLogic.ST.TF.Expression: Allows to write rules using arithmetic operators. It creates temporary variables automatically. Example: (a+b)*c =:= d resolves to a+b = x, x*c = d. For an executable example see UniqueLogic.ST.TF.Example.Expression.
- UniqueLogic.ST.TF.System.Simple: Provides specialised functions from UniqueLogic.ST.TF.System for the case of a system without labels and consistency checks.
- UniqueLogic.ST.TF.System.Label: Provides a custom constructor for variables. When creating a variable you decide whether and how an assignment to this variable shall be logged. There is an example that shows how to solve a logic system using symbolic expressions. The naming and logging allows us to observe shared intermediate results. For an executable example see UniqueLogic.ST.TF.Example.Label.
- By using more sophisticated monad transformers, we can check the equations for consistency, report inconsistencies and how they arised. We demonstrate that in UniqueLogic.ST.TF.Example.Verify.
This variant of the package requires type families.
package units-defs

Definitions for use with the units package This package provides system definitions for use with the separate units package. See the individual modules for details. User contributions to this package are strongly encouraged. Please submit pull requests!

Page 260 of many | Previous | Next