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.
piSort :: Dom Term -> Sort -> Abs Sort -> SortAgda Agda.TypeChecking.Substitute No documentation available.
piSort' :: Dom Term -> Sort -> Abs Sort -> Either Blocker SortAgda Agda.TypeChecking.Substitute Compute the sort of a pi 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 doesn't reduce to Set
sizeOfSort :: Sort -> Either Blocker SizeOfSortAgda Agda.TypeChecking.Substitute Returns Left blocker for unknown (blocked) sorts, and otherwise returns Right s where s indicates the size and fibrancy.
-
Agda Agda.TypeChecking.Substitute No documentation available.
szSortSize :: SizeOfSort -> IntegerAgda Agda.TypeChecking.Substitute No documentation available.
szSortUniv :: SizeOfSort -> UnivAgda Agda.TypeChecking.Substitute No documentation available.
-
Agda Agda.TypeChecking.Substitute No documentation available.
univSort' :: Sort -> Either Blocker SortAgda Agda.TypeChecking.Substitute univSort' univInf s gets the next higher sort of s, if it is known (i.e. it is not just UnivSort s). Precondition: s is reduced
module Agda.Utils.Graph.
TopSort No documentation available.
topSort :: Ord n => Set n -> [(n, n)] -> Maybe [n]Agda Agda.Utils.Graph.TopSort topoligical sort with smallest-numbered available vertex first | input: nodes, edges | output is Nothing if the graph is not a DAG Note: should be stable to preserve order of generalizable variables. Algorithm due to Richard Eisenberg, and works by walking over the list left-to-right and moving each node the minimum distance left to guarantee topological ordering.