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

Safe HaskellNone
LanguageHaskell2010

Agda.TypeChecking.DropArgs

Contents

Synopsis

Dropping initial arguments to create a projection-like function

class DropArgs a where Source #

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

Minimal complete definition

dropArgs

Methods

dropArgs :: Int -> a -> a Source #

Instances

DropArgs Permutation Source # 
DropArgs Clause Source #

NOTE: does not work for recursive functions.

Methods

dropArgs :: Int -> Clause -> Clause Source #

DropArgs Telescope Source #

NOTE: This creates telescopes with unbound de Bruijn indices.

DropArgs CompiledClauses Source #

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.

DropArgs FunctionInverse Source # 
DropArgs a => DropArgs (Maybe a) Source # 

Methods

dropArgs :: Int -> Maybe a -> Maybe a Source #