Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. class (PartialOrd a, Semigroup a) => POSemigroup a

   Agda	Agda.Utils.POMonoid

   Partially ordered semigroup. Law: composition must be monotone.

   related x POLE x' && related y POLE y' ==>
   related (x <> y) POLE (x' <> y')
   

2. data Parser k r tok a

   Agda	Agda.Utils.Parser.MemoisedCPS

   The parser type. The parameters of the type Parser k r tok a have the following meanings:

   • k Type used for memoisation keys.
   • r The type of memoised values. (Yes, all memoised values have to have the same type.)
   • tok The token type.
   • a The result type.

3. class (Functor p, Applicative p, Alternative p, Monad p) => ParserClass (p :: Type -> Type) k r tok | p -> k, p -> r, p -> tok

   Agda	Agda.Utils.Parser.MemoisedCPS

   No documentation available.

4. data ParserWithGrammar k r tok a

   Agda	Agda.Utils.Parser.MemoisedCPS

   An extended parser type, with some support for printing parsers.

5. module Agda.Utils.PartialOrd

   No documentation available.

6. POAny :: PartialOrdering

   Agda	Agda.Utils.PartialOrd

   No information (incomparable).

7. POEQ :: PartialOrdering

   Agda	Agda.Utils.PartialOrd

   Equal

8. POGE :: PartialOrdering

   Agda	Agda.Utils.PartialOrd

   Greater or equal.

9. POGT :: PartialOrdering

   Agda	Agda.Utils.PartialOrd

   Greater than.

10. POLE :: PartialOrdering

    Agda	Agda.Utils.PartialOrd

    Less or equal than.

Page 1150 of many | Previous | Next