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

Safe HaskellNone
LanguageHaskell2010

Agda.TypeChecking.Rules.LHS.Implicit

Synopsis

Documentation

insertImplicitProblem :: Problem -> TCM Problem Source #

Insert implicit patterns in a problem.

expandImplicitPattern :: Type -> NamedArg Pattern -> TCM (NamedArg Pattern) Source #

Eta-expand implicit pattern if of record type.

expandImplicitPattern' :: Type -> NamedArg Pattern -> TCM (Maybe (NamedArg Pattern)) Source #

Try to eta-expand implicit pattern. Returns Nothing unless dealing with a record type that has eta-expansion and a constructor c. In this case, it returns Just c _ _ ... _ (record constructor applied to as many implicit patterns as there are fields).

insertImplicitPatterns :: ExpandHidden -> [NamedArg Pattern] -> Telescope -> TCM [NamedArg Pattern] Source #

Insert implicit patterns in a list of patterns. Even if DontExpandLast, trailing SIZELT patterns are inserted.

insertImplicitSizeLtPatterns :: Type -> TCM [NamedArg Pattern] Source #

Insert trailing SizeLt patterns, if any.

insertImplicitPatternsT :: ExpandHidden -> [NamedArg Pattern] -> Type -> TCM [NamedArg Pattern] Source #

Insert implicit patterns in a list of patterns. Even if DontExpandLast, trailing SIZELT patterns are inserted.