Agda.TypeChecking.DropArgs

Dropping initial arguments to create a projection-like function

class DropArgs a where

When making a function projection-like, we drop the first n arguments.

Methods

dropArgs :: Int -> a -> a

Instances

DropArgs Permutation

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> Permutation -> Permutation

DropArgs SplitTree

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> SplitTree -> SplitTree

DropArgs Clause

NOTE: does not work for recursive functions.

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> Clause -> Clause

DropArgs Telescope

NOTE: This creates telescopes with unbound de Bruijn indices.

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> Telescope -> Telescope

DropArgs Term

Use for dropping initial lambdas in clause bodies. NOTE: does not reduce term, need lambdas to be present.

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> Term -> Term

DropArgs CompiledClauses

To drop the first n arguments in a compiled clause, we reduce the split argument indices by n and drop n arguments from the bodies. NOTE: this only works for non-recursive functions, we are not dropping arguments to recursive calls in bodies.

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> CompiledClauses -> CompiledClauses

DropArgs FunctionInverse

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> FunctionInverse -> FunctionInverse

DropArgs a => DropArgs (Maybe a)

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> Maybe a -> Maybe a