Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. inferUnivSort :: (PureTCM m, MonadConstraint m) => Sort -> m Sort

    Agda Agda.TypeChecking.Sort

    Infer the sort of another sort. If we can compute the bigger sort straight away, return that. Otherwise, return UnivSort s and add a constraint to ensure we can compute the sort eventually.

  2. shouldBeSort :: (PureTCM m, MonadBlock m, MonadError TCErr m) => Type -> m Sort

    Agda Agda.TypeChecking.Sort

    Result is in reduced form.

  3. pattern LargeSort :: Univ -> Integer -> SizeOfSort

    Agda Agda.TypeChecking.Substitute

    No documentation available.

  4. data SizeOfSort

    Agda Agda.TypeChecking.Substitute

    A sort can either be small (Set l, Prop l, Size, ...) or large (Setω n).

  5. SizeOfSort :: Univ -> Integer -> SizeOfSort

    Agda Agda.TypeChecking.Substitute

    No documentation available.

  6. pattern SmallSort :: Univ -> SizeOfSort

    Agda Agda.TypeChecking.Substitute

    No documentation available.

  7. funSort :: Sort -> Sort -> Sort

    Agda Agda.TypeChecking.Substitute

    No documentation available.

  8. funSort' :: Sort -> Sort -> Either Blocker Sort

    Agda Agda.TypeChecking.Substitute

    Compute the sort of a function type from the sorts of its domain and codomain. This function should only be called on reduced sorts, since the LevelUniv rules should only apply when the sort does not reduce to Set.

  9. isSmallSort :: Sort -> Bool

    Agda Agda.TypeChecking.Substitute

    No documentation available.

  10. mkPiSort :: Dom Type -> Abs Type -> Sort

    Agda Agda.TypeChecking.Substitute

    No documentation available.

Page 205 of many | Previous | Next