Safe Haskell	None
Language	Haskell98

Agda.TypeChecking.CompiledClause

Contents

Description

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.

Synopsis

Documentation

Constructors

WithArity
Fields arity :: Int content :: c

Instances

Functor WithArity Source
Foldable WithArity Source
Traversable WithArity Source
Monoid c => Monoid (WithArity c) Source
Pretty a => Pretty (WithArity a) Source
KillRange c => KillRange (WithArity c) Source
Abstract a => Abstract (WithArity a) Source
Apply a => Apply (WithArity a) Source
InstantiateFull a => InstantiateFull (WithArity a) Source

Branches in a case tree.

Constructors

Branches
Fields projPatterns :: Bool We are constructing a record here (copatterns). `conBranches` lists projections. 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 Source
Foldable Case Source
Traversable Case Source
Pretty a => Show (Case a) Source
Monoid m => Monoid (Case m) Source
Null (Case m) Source
Pretty a => Pretty (Case a) Source
KillRange c => KillRange (Case c) Source
Abstract a => Abstract (Case a) Source
Apply a => Apply (Case a) Source
InstantiateFull a => InstantiateFull (Case a) Source

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 Source
Pretty CompiledClauses Source
KillRange CompiledClauses Source
Abstract CompiledClauses Source
Apply CompiledClauses Source
InstantiateFull CompiledClauses Source
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.

Check whether a case tree has a catch-all clause.

Pretty instances.