Agda-2.3.2: A dependently typed functional programming language and proof assistant

Safe HaskellNone

Agda.TypeChecking.Telescope

Synopsis

Documentation

renameP :: Subst t => Permutation -> t -> t

The permutation should permute the corresponding telescope. (left-to-right list)

renaming :: Permutation -> Substitution

If permute π : [a]Γ -> [], then applySubst (renaming π) : Term Γ -> Term

renamingR :: Permutation -> Substitution

If permute π : [a]Γ -> [], then substs (renamingR π) : Term Δ -> Term

flattenTel :: Telescope -> [Dom Type]

Flatten telescope: (Γ : Tel) -> [Type]

reorderTel :: [Dom Type] -> Maybe Permutation

Order a flattened telescope in the correct dependeny order: Γ -> Permutation (Γ -> Γ~

unflattenTel :: [String] -> [Dom Type] -> Telescope

Unflatten: turns a flattened telescope into a proper telescope. Must be properly ordered.

teleNames :: Telescope -> [String]

Get the suggested names from a telescope

data SplitTel

A telescope split in two.

splitTelescope :: VarSet -> Telescope -> SplitTel

Split a telescope into the part that defines the given variables and the part that doesn't.

telViewUpTo :: Int -> Type -> TCM TelView

telViewUpTo n t takes off the first n function types of t. Takes off all if n < 0.

telViewUpTo' :: Int -> (Dom Type -> Bool) -> Type -> TCM TelView

telViewUpTo' n p t takes off $t$ the first n (or arbitrary many if n < 0) function domains as long as they satify p.

piApplyM :: Type -> Args -> TCM Type

A safe variant of piApply.