Agda- A dependently typed functional programming language and proof assistant

Safe HaskellNone




flexiblePatterns :: [NamedArg Pattern] -> TCM FlexibleVars Source #

Compute the set of flexible patterns in a list of patterns. The result is the deBruijn indices of the flexible patterns.

updateInPatterns Source #


:: [Dom Type]

the types of the old pattern variables, relative to the new telescope

-> [NamedArg Pattern]

old in patterns

-> [Arg DeBruijnPattern]

patterns to be substituted, living in the new telescope

-> TCM ([NamedArg Pattern], [DotPatternInst]) 

Update the in patterns according to the given substitution, collecting new dot pattern instantiations in the process.

isSolvedProblem :: Problem -> Bool Source #

Check if a problem is solved. That is, if the patterns are all variables.

noShadowingOfConstructors Source #


:: Call

Trace, e.g., CheckPatternShadowing clause

-> Problem 
-> TCM () 

For each user-defined pattern variable in the Problem, check that the corresponding data type (if any) does not contain a constructor of the same name (which is not in scope); this "shadowing" could indicate an error, and is not allowed.

Precondition: The problem has to be solved.

checkDotPattern :: DotPatternInst -> TCM () Source #

Check that a dot pattern matches it's instantiation.

checkLeftoverDotPatterns Source #


:: [NamedArg Pattern]

Leftover patterns after splitting is completed

-> [Int]

De Bruijn indices of leftover variable patterns computed by splitting

-> [Dom Type]

Types of leftover patterns

-> [DotPatternInst]

Instantiations computed by unifier

-> TCM () 

Checks whether the dot patterns left over after splitting can be covered by shuffling around the dots from implicit positions. Returns the updated user patterns (without dot patterns).

bindLHSVars :: [NamedArg Pattern] -> Telescope -> TCM a -> TCM a Source #

Bind the variables in a left hand side and check that Hiding of the patterns matches the hiding info in the type.

Precondition: the patterns should all be VarP, WildP, or AbsurdP and the telescope should have the same size as the pattern list. There could also be ConPs resulting from eta expanded implicit record patterns.

bindAsPatterns :: [AsBinding] -> TCM a -> TCM a Source #

Bind as patterns

data LHSResult Source #

Result of checking the LHS of a clause.




checkLeftHandSide Source #


:: Call

Trace, e.g. CheckPatternShadowing clause

-> Maybe QName

The name of the definition we are checking.

-> [NamedArg Pattern]

The patterns.

-> Type

The expected type a = Γ → b.

-> (LHSResult -> TCM a)


-> TCM a 

Check a LHS. Main function.

checkLeftHandSide a ps a ret checks that user patterns ps eliminate the type a of the defined function, and calls continuation ret if successful.

checkLHS Source #


:: Maybe QName

The name of the definition we are checking.

-> LHSState

The current state.

-> TCM LHSState

The final state after all splitting is completed

The loop (tail-recursive): split at a variable in the problem until problem is solved

noPatternMatchingOnCodata :: [NamedArg DeBruijnPattern] -> TCM () Source #

Ensures that we are not performing pattern matching on codata.