Agda.TypeChecking.CompiledClause

Case trees.

After coverage checking, pattern matching is translated to case trees, i.e., a tree of successive case splits on one variable at a time.

Documentation

data WithArity c

Constructors

WithArity

Fields

arity :: Int

content :: c

Instances

Functor WithArity

Foldable WithArity

Traversable WithArity

Monoid c => Monoid (WithArity c)

Pretty a => Pretty (WithArity a)

KillRange c => KillRange (WithArity c)

Abstract a => Abstract (WithArity a)

Apply a => Apply (WithArity a)

EmbPrj a => EmbPrj (WithArity a)

InstantiateFull a => InstantiateFull (WithArity a)

Typeable (* -> *) WithArity

data Case c

Branches in a case tree.

Constructors

Branches

Fields

conBranches :: Map QName (WithArity c)

Map from constructor (or projection) names to their arity and the case subtree. (Projections have arity 0.)

litBranches :: Map Literal c

Map from literal to case subtree.

catchAllBranch :: Maybe c

(Possibly additional) catch-all clause.

Instances

Functor Case

Foldable Case

Traversable Case

Pretty a => Show (Case a)

Monoid m => Monoid (Case m)

Pretty a => Pretty (Case a)

KillRange c => KillRange (Case c)

Abstract a => Abstract (Case a)

Apply a => Apply (Case a)

EmbPrj a => EmbPrj (Case a)

InstantiateFull a => InstantiateFull (Case a)

Typeable (* -> *) Case

data CompiledClauses

Case tree with bodies.

Constructors

Case Int (Case CompiledClauses)

Case n bs stands for a match on the n-th argument (counting from zero) with bs as the case branches. If the n-th argument is a projection, we have only conBranches. with arity 0.

Done [Arg ArgName] Term

Done xs b stands for the body b where the xs contains hiding and name suggestions for the free variables. This is needed to build lambdas on the right hand side for partial applications which can still reduce.

Fail

Absurd case.

Instances

Show CompiledClauses

Pretty CompiledClauses

KillRange CompiledClauses

Abstract CompiledClauses

Apply CompiledClauses

EmbPrj CompiledClauses

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.

InstantiateFull CompiledClauses

Typeable * CompiledClauses

emptyBranches :: Case CompiledClauses

litCase :: Literal -> c -> Case c

conCase :: QName -> WithArity c -> Case c

catchAll :: c -> Case c

Pretty instances.

prettyMap :: (Show k, Pretty v) => Map k v -> [Doc]