Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. PoisonPill :: WorkerMessage

   katip	Katip.Core

   No documentation available.

2. newtype ProcessIDJs

   katip	Katip.Core

   No documentation available.

3. ProcessIDJs :: ProcessID -> ProcessIDJs

   katip	Katip.Core

   No documentation available.

4. class (KnownSymbol KVPath value, EncodeKV KeyType value, DecodeKV KeyType value) => PathOf value

   keyed-vals	KeyedVals.Handle.Typed

   Links the storage path of a group of key-values to the types of the key and value.

5. module Algebra.PartialOrd

   No documentation available.

6. class Eq a => PartialOrd a

   lattices	Algebra.PartialOrd

   A partial ordering on sets (http://en.wikipedia.org/wiki/Partially_ordered_set) is a set equipped with a binary relation, leq, that obeys the following laws

   Reflexive:     a `leq` a
   Antisymmetric: a `leq` b && b `leq` a ==> a == b
   Transitive:    a `leq` b && b `leq` c ==> a `leq` c
   

   Two elements of the set are said to be comparable when they are are ordered with respect to the leq relation. So

   comparable a b ==> a `leq` b || b `leq` a
   

   If comparable always returns true then the relation leq defines a total ordering (and an Ord instance may be defined). Any Ord instance is trivially an instance of PartialOrd. Ordered provides a convenient wrapper to satisfy PartialOrd given Ord. As an example consider the partial ordering on sets induced by set inclusion. Then for sets a and b,

   a `leq` b
   

   is true when a is a subset of b. Two sets are comparable if one is a subset of the other. Concretely

   a = {1, 2, 3}
   b = {1, 3, 4}
   c = {1, 2}
   
   a `leq` a = True
   a `leq` b = False
   a `leq` c = False
   b `leq` a = False
   b `leq` b = True
   b `leq` c = False
   c `leq` a = True
   c `leq` b = False
   c `leq` c = True
   
   comparable a b = False
   comparable a c = True
   comparable b c = False
   

7. data PCont i j a

   lens-family-core	Lens.Family

   No documentation available.

8. class Functor f => Phantom (f :: Type -> Type)

   lens-family-core	Lens.Family

   No documentation available.

9. data Product a

   lens-family-core	Lens.Family

   Monoid under multiplication.

   Product x <> Product y == Product (x * y)
   

   Examples

   >>> Product 3 <> Product 4 <> mempty
   Product {getProduct = 12}
   

   >>> mconcat [ Product n | n <- [2 .. 10]]
   Product {getProduct = 3628800}
   

10. data PKleeneStore i j a

    lens-family-core	Lens.Family.Clone

    No documentation available.

Page 717 of many | Previous | Next