Hoogle Search

Within LTS Haskell 24.55 (ghc-9.10.3)

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

Exact lookup

1. leqSuccStepR :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> IsTrue (n <=? m) -> IsTrue (n <=? Succ m)

   type-natural	Data.Type.Natural.Lemma.Order

   No documentation available.

2. lneqSuccStepL :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> IsTrue (Succ n <? m) -> IsTrue (n <? m)

   type-natural	Data.Type.Natural.Lemma.Order

   No documentation available.

3. lneqSuccStepR :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> IsTrue (n <? m) -> IsTrue (n <? Succ m)

   type-natural	Data.Type.Natural.Lemma.Order

   No documentation available.

4. enumFromStepN :: forall a (m :: Type -> Type) . (Num a, Monad m) => a -> a -> Int -> Stream m a

   vector-stream	Data.Stream.Monadic

   Yield a Stream of the given length containing the values x, x+y, x+y+y etc.

5. TraceStep :: (Text, Text) -> UnpickleError -> UnpickleError

   xml-picklers	Data.XML.Pickle

   No documentation available.

6. completionStep :: (?cutoff :: CutOff, Monoid cinfo) => CallGraph cinfo -> CallGraph cinfo -> (CallGraph cinfo, CallGraph cinfo)

   Agda	Agda.Termination.CallGraph

   No documentation available.

7. unfoldDefinitionStep :: Term -> QName -> Elims -> ReduceM (Reduced (Blocked Term) Term)

   Agda	Agda.TypeChecking.Reduce

   No documentation available.

8. badStep :: NoLeftInv -> UnifyStep

   Agda	Agda.TypeChecking.Rules.LHS.Unify

   No documentation available.

9. badStep :: NoLeftInv -> UnifyStep

   Agda	Agda.TypeChecking.Rules.LHS.Unify

   No documentation available.

10. badStep :: NoLeftInv -> UnifyStep

    Agda	Agda.TypeChecking.Rules.LHS.Unify.LeftInverse

    No documentation available.

Page 75 of many | Previous | Next