Safe Haskell	Safe-Inferred
Language	Haskell2010

Agda.Syntax.Treeless

Description

The treeless syntax is intended to be used as input for the compiler backends. It is more low-level than Internal syntax and is not used for type checking.

Some of the features of treeless syntax are: - case expressions instead of case trees - no instantiated datatypes / constructors

Synopsis

module Agda.Syntax.Abstract.Name
data ArgUsage
- = ArgUsed
- | ArgUnused
data TTerm
- = TVar Int
- | TPrim TPrim
- | TDef QName
- | TApp TTerm Args
- | TLam TTerm
- | TLit Literal
- | TCon QName
- | TLet TTerm TTerm
- | TCase Int CaseInfo TTerm [TAlt]
- | TUnit
- | TSort
- | TErased
- | TCoerce TTerm
- | TError TError
data EvaluationStrategy
- = LazyEvaluation
- | EagerEvaluation
data Compiled = Compiled {
- cTreeless :: TTerm
- cArgUsage :: Maybe [ArgUsage]
}
type Args = [TTerm]
class Unreachable a where
- isUnreachable :: a -> Bool
data TPrim
- = PAdd
- | PAdd64
- | PSub
- | PSub64
- | PMul
- | PMul64
- | PQuot
- | PQuot64
- | PRem
- | PRem64
- | PGeq
- | PLt
- | PLt64
- | PEqI
- | PEq64
- | PEqF
- | PEqS
- | PEqC
- | PEqQ
- | PIf
- | PSeq
- | PITo64
- | P64ToI
data CaseInfo = CaseInfo {
- caseLazy :: Bool
- caseErased :: Erased
- caseType :: CaseType
}
data TAlt
- = TACon {
  - aCon :: QName
  - aArity :: Int
  - aBody :: TTerm
  }
- | TAGuard {
  - aGuard :: TTerm
  - aBody :: TTerm
  }
- | TALit {
  - aLit :: Literal
  - aBody :: TTerm
  }
data TError
- = TUnreachable
- | TMeta String
data CaseType
- = CTData QName
- | CTNat
- | CTInt
- | CTChar
- | CTString
- | CTFloat
- | CTQName
pattern TPOp :: TPrim -> TTerm -> TTerm -> TTerm
pattern TPFn :: TPrim -> TTerm -> TTerm
filterUsed :: [ArgUsage] -> [a] -> [a]
mkLet :: TTerm -> TTerm -> TTerm
isPrimEq :: TPrim -> Bool
coerceView :: TTerm -> (Bool, TTerm)
mkTApp :: TTerm -> Args -> TTerm
tAppView :: TTerm -> (TTerm, [TTerm])
coerceAppView :: TTerm -> ((Bool, TTerm), [TTerm])
tLetView :: TTerm -> ([TTerm], TTerm)
tLamView :: TTerm -> (Int, TTerm)
mkTLam :: Int -> TTerm -> TTerm
tInt :: Integer -> TTerm
intView :: TTerm -> Maybe Integer
word64View :: TTerm -> Maybe Word64
tPlusK :: Integer -> TTerm -> TTerm
tOp :: TPrim -> TTerm -> TTerm -> TTerm
tNegPlusK :: Integer -> TTerm -> TTerm
plusKView :: TTerm -> Maybe (Integer, TTerm)
negPlusKView :: TTerm -> Maybe (Integer, TTerm)
tUnreachable :: TTerm
tIfThenElse :: TTerm -> TTerm -> TTerm -> TTerm

Documentation

module Agda.Syntax.Abstract.Name

data ArgUsage Source #

Usage status of function arguments in treeless code.

Constructors

ArgUsed
ArgUnused

Instances

Instances details

Generic ArgUsage Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep ArgUsage :: Type -> Type Methods from :: ArgUsage -> Rep ArgUsage x to :: Rep ArgUsage x -> ArgUsage
Show ArgUsage Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> ArgUsage -> ShowS show :: ArgUsage -> String showList :: [ArgUsage] -> ShowS
NFData ArgUsage Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: ArgUsage -> ()
Eq ArgUsage Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: ArgUsage -> ArgUsage -> Bool (/=) :: ArgUsage -> ArgUsage -> Bool
Ord ArgUsage Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: ArgUsage -> ArgUsage -> Ordering (<) :: ArgUsage -> ArgUsage -> Bool (<=) :: ArgUsage -> ArgUsage -> Bool (>) :: ArgUsage -> ArgUsage -> Bool (>=) :: ArgUsage -> ArgUsage -> Bool max :: ArgUsage -> ArgUsage -> ArgUsage min :: ArgUsage -> ArgUsage -> ArgUsage
type Rep ArgUsage Source #
Instance details Defined in Agda.Syntax.Treeless type Rep ArgUsage = D1 ('MetaData "ArgUsage" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) (C1 ('MetaCons "ArgUsed" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ArgUnused" 'PrefixI 'False) (U1 :: Type -> Type))

data TTerm Source #

Treeless Term. All local variables are using de Bruijn indices.

Constructors

TVar Int
TPrim TPrim
TDef QName
TApp TTerm Args
TLam TTerm
TLit Literal
TCon QName
TLet TTerm TTerm	introduces a new (non-recursive) local binding. The bound term MUST only be evaluated if it is used inside the body. Sharing may happen, but is optional. It is also perfectly valid to just inline the bound term in the body.
TCase Int CaseInfo TTerm [TAlt]	Case scrutinee (always variable), case type, default value, alternatives First, all TACon alternatives are tried; then all TAGuard alternatives in top to bottom order. TACon alternatives must not overlap.
TUnit
TSort
TErased
TCoerce TTerm	Used by the GHC backend
TError TError	A runtime error, something bad has happened.

Instances

Instances details

HasFree TTerm Source #
Instance details Defined in Agda.Compiler.Treeless.Subst Methods freeVars :: TTerm -> Map Int Occurs Source #
Pretty TTerm Source #
Instance details Defined in Agda.Compiler.Treeless.Pretty Methods pretty :: TTerm -> Doc Source # prettyPrec :: Int -> TTerm -> Doc Source # prettyList :: [TTerm] -> Doc Source #
NamesIn TTerm Source #
Instance details Defined in Agda.Syntax.Internal.Names Methods namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> TTerm -> m Source #
Unreachable TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Methods isUnreachable :: TTerm -> Bool Source #
Subst TTerm Source #
Instance details Defined in Agda.Compiler.Treeless.Subst Associated Types type SubstArg TTerm Source # Methods applySubst :: Substitution' (SubstArg TTerm) -> TTerm -> TTerm Source #
DeBruijn TTerm Source #
Instance details Defined in Agda.Compiler.Treeless.Subst Methods deBruijnVar :: Int -> TTerm Source # debruijnNamedVar :: String -> Int -> TTerm Source # deBruijnView :: TTerm -> Maybe Int Source #
Generic TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep TTerm :: Type -> Type Methods from :: TTerm -> Rep TTerm x to :: Rep TTerm x -> TTerm
Show TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> TTerm -> ShowS show :: TTerm -> String showList :: [TTerm] -> ShowS
NFData TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: TTerm -> ()
Eq TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: TTerm -> TTerm -> Bool (/=) :: TTerm -> TTerm -> Bool
Ord TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: TTerm -> TTerm -> Ordering (<) :: TTerm -> TTerm -> Bool (<=) :: TTerm -> TTerm -> Bool (>) :: TTerm -> TTerm -> Bool (>=) :: TTerm -> TTerm -> Bool max :: TTerm -> TTerm -> TTerm min :: TTerm -> TTerm -> TTerm
type SubstArg TTerm Source #
Instance details Defined in Agda.Compiler.Treeless.Subst type SubstArg TTerm = TTerm
type Rep TTerm Source #
Instance details Defined in Agda.Syntax.Treeless type Rep TTerm = D1 ('MetaData "TTerm" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) (((C1 ('MetaCons "TVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: (C1 ('MetaCons "TPrim" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TPrim)) :+: C1 ('MetaCons "TDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))) :+: ((C1 ('MetaCons "TApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args)) :+: C1 ('MetaCons "TLam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm))) :+: (C1 ('MetaCons "TLit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Literal)) :+: C1 ('MetaCons "TCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))))) :+: ((C1 ('MetaCons "TLet" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm)) :+: (C1 ('MetaCons "TCase" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CaseInfo)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TAlt]))) :+: C1 ('MetaCons "TUnit" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TSort" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TErased" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TCoerce" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm)) :+: C1 ('MetaCons "TError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TError))))))

data EvaluationStrategy Source #

The treeless compiler can behave differently depending on the target language evaluation strategy. For instance, more aggressive erasure for lazy targets.

Constructors

LazyEvaluation
EagerEvaluation

Instances

Instances details

Show EvaluationStrategy Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> EvaluationStrategy -> ShowS show :: EvaluationStrategy -> String showList :: [EvaluationStrategy] -> ShowS
Eq EvaluationStrategy Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: EvaluationStrategy -> EvaluationStrategy -> Bool (/=) :: EvaluationStrategy -> EvaluationStrategy -> Bool

data Compiled Source #

Constructors

Compiled
Fields cTreeless :: TTerm cArgUsage :: Maybe [ArgUsage] `Nothing` if treeless usage analysis has not run yet.

Instances

Instances details

Pretty Compiled Source #
Instance details Defined in Agda.Compiler.Treeless.Pretty Methods pretty :: Compiled -> Doc Source # prettyPrec :: Int -> Compiled -> Doc Source # prettyList :: [Compiled] -> Doc Source #
NamesIn Compiled Source #
Instance details Defined in Agda.Syntax.Internal.Names Methods namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> Compiled -> m Source #
KillRange Compiled Source #
Instance details Defined in Agda.Syntax.Treeless Methods killRange :: KillRangeT Compiled Source #
Generic Compiled Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep Compiled :: Type -> Type Methods from :: Compiled -> Rep Compiled x to :: Rep Compiled x -> Compiled
Show Compiled Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> Compiled -> ShowS show :: Compiled -> String showList :: [Compiled] -> ShowS
NFData Compiled Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: Compiled -> ()
Eq Compiled Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: Compiled -> Compiled -> Bool (/=) :: Compiled -> Compiled -> Bool
Ord Compiled Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: Compiled -> Compiled -> Ordering (<) :: Compiled -> Compiled -> Bool (<=) :: Compiled -> Compiled -> Bool (>) :: Compiled -> Compiled -> Bool (>=) :: Compiled -> Compiled -> Bool max :: Compiled -> Compiled -> Compiled min :: Compiled -> Compiled -> Compiled
type Rep Compiled Source #
Instance details Defined in Agda.Syntax.Treeless type Rep Compiled = D1 ('MetaData "Compiled" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) (C1 ('MetaCons "Compiled" 'PrefixI 'True) (S1 ('MetaSel ('Just "cTreeless") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm) :*: S1 ('MetaSel ('Just "cArgUsage") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [ArgUsage]))))

type Args = [TTerm] Source #

class Unreachable a where Source #

Methods

isUnreachable :: a -> Bool Source #

Checks if the given expression is unreachable or not.

Instances

Instances details

Unreachable TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Methods isUnreachable :: TAlt -> Bool Source #
Unreachable TTerm Source #
Instance details Defined in Agda.Syntax.Treeless Methods isUnreachable :: TTerm -> Bool Source #

data TPrim Source #

Constructors

PAdd
PAdd64
PSub
PSub64
PMul
PMul64
PQuot
PQuot64
PRem
PRem64
PGeq
PLt
PLt64
PEqI
PEq64
PEqF
PEqS
PEqC
PEqQ
PIf
PSeq
PITo64
P64ToI

Instances

Instances details

Generic TPrim Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep TPrim :: Type -> Type Methods from :: TPrim -> Rep TPrim x to :: Rep TPrim x -> TPrim
Show TPrim Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> TPrim -> ShowS show :: TPrim -> String showList :: [TPrim] -> ShowS
NFData TPrim Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: TPrim -> ()
Eq TPrim Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: TPrim -> TPrim -> Bool (/=) :: TPrim -> TPrim -> Bool
Ord TPrim Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: TPrim -> TPrim -> Ordering (<) :: TPrim -> TPrim -> Bool (<=) :: TPrim -> TPrim -> Bool (>) :: TPrim -> TPrim -> Bool (>=) :: TPrim -> TPrim -> Bool max :: TPrim -> TPrim -> TPrim min :: TPrim -> TPrim -> TPrim
type Rep TPrim Source #
Instance details Defined in Agda.Syntax.Treeless type Rep TPrim = D1 ('MetaData "TPrim" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) ((((C1 ('MetaCons "PAdd" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PAdd64" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PSub" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PSub64" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PMul" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "PMul64" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PQuot" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PQuot64" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "PRem" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PRem64" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PGeq" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "PLt" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PLt64" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PEqI" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "PEq64" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PEqF" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PEqS" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "PEqC" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PEqQ" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PIf" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "PSeq" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PITo64" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "P64ToI" 'PrefixI 'False) (U1 :: Type -> Type))))))

data CaseInfo Source #

Constructors

CaseInfo
Fields caseLazy :: Bool caseErased :: Erased Is this a match on an erased argument? caseType :: CaseType

Instances

Instances details

NamesIn CaseInfo Source #
Instance details Defined in Agda.Syntax.Internal.Names Methods namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> CaseInfo -> m Source #
Generic CaseInfo Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep CaseInfo :: Type -> Type Methods from :: CaseInfo -> Rep CaseInfo x to :: Rep CaseInfo x -> CaseInfo
Show CaseInfo Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> CaseInfo -> ShowS show :: CaseInfo -> String showList :: [CaseInfo] -> ShowS
NFData CaseInfo Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: CaseInfo -> ()
Eq CaseInfo Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: CaseInfo -> CaseInfo -> Bool (/=) :: CaseInfo -> CaseInfo -> Bool
Ord CaseInfo Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: CaseInfo -> CaseInfo -> Ordering (<) :: CaseInfo -> CaseInfo -> Bool (<=) :: CaseInfo -> CaseInfo -> Bool (>) :: CaseInfo -> CaseInfo -> Bool (>=) :: CaseInfo -> CaseInfo -> Bool max :: CaseInfo -> CaseInfo -> CaseInfo min :: CaseInfo -> CaseInfo -> CaseInfo
type Rep CaseInfo Source #
Instance details Defined in Agda.Syntax.Treeless type Rep CaseInfo = D1 ('MetaData "CaseInfo" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) (C1 ('MetaCons "CaseInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "caseLazy") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :: (S1 ('MetaSel ('Just "caseErased") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Erased) :: S1 ('MetaSel ('Just "caseType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CaseType))))

data TAlt Source #

Constructors

TACon	Matches on the given constructor. If the match succeeds, the pattern variables are prepended to the current environment (pushes all existing variables aArity steps further away)
Fields aCon :: QName aArity :: Int aBody :: TTerm
TAGuard	Binds no variables The guard must only use the variable that the case expression matches on.
Fields aGuard :: TTerm aBody :: TTerm
TALit
Fields aLit :: Literal aBody :: TTerm

Instances

Instances details

HasFree TAlt Source #
Instance details Defined in Agda.Compiler.Treeless.Subst Methods freeVars :: TAlt -> Map Int Occurs Source #
NamesIn TAlt Source #
Instance details Defined in Agda.Syntax.Internal.Names Methods namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> TAlt -> m Source #
Unreachable TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Methods isUnreachable :: TAlt -> Bool Source #
Subst TAlt Source #
Instance details Defined in Agda.Compiler.Treeless.Subst Associated Types type SubstArg TAlt Source # Methods applySubst :: Substitution' (SubstArg TAlt) -> TAlt -> TAlt Source #
Generic TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep TAlt :: Type -> Type Methods from :: TAlt -> Rep TAlt x to :: Rep TAlt x -> TAlt
Show TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> TAlt -> ShowS show :: TAlt -> String showList :: [TAlt] -> ShowS
NFData TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: TAlt -> ()
Eq TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: TAlt -> TAlt -> Bool (/=) :: TAlt -> TAlt -> Bool
Ord TAlt Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: TAlt -> TAlt -> Ordering (<) :: TAlt -> TAlt -> Bool (<=) :: TAlt -> TAlt -> Bool (>) :: TAlt -> TAlt -> Bool (>=) :: TAlt -> TAlt -> Bool max :: TAlt -> TAlt -> TAlt min :: TAlt -> TAlt -> TAlt
type SubstArg TAlt Source #
Instance details Defined in Agda.Compiler.Treeless.Subst type SubstArg TAlt = TTerm
type Rep TAlt Source #
Instance details Defined in Agda.Syntax.Treeless type Rep TAlt = D1 ('MetaData "TAlt" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) (C1 ('MetaCons "TACon" 'PrefixI 'True) (S1 ('MetaSel ('Just "aCon") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :: (S1 ('MetaSel ('Just "aArity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :: S1 ('MetaSel ('Just "aBody") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm))) :+: (C1 ('MetaCons "TAGuard" 'PrefixI 'True) (S1 ('MetaSel ('Just "aGuard") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm) :: S1 ('MetaSel ('Just "aBody") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm)) :+: C1 ('MetaCons "TALit" 'PrefixI 'True) (S1 ('MetaSel ('Just "aLit") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Literal) :: S1 ('MetaSel ('Just "aBody") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TTerm))))

data TError Source #

Constructors

TUnreachable	Code which is unreachable. E.g. absurd branches or missing case defaults. Runtime behaviour of unreachable code is undefined, but preferably the program will exit with an error message. The compiler is free to assume that this code is unreachable and to remove it.
TMeta String	Code which could not be obtained because of a hole in the program. This should throw a runtime error. The string gives some information about the meta variable that got compiled.

Instances

Instances details

Generic TError Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep TError :: Type -> Type Methods from :: TError -> Rep TError x to :: Rep TError x -> TError
Show TError Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> TError -> ShowS show :: TError -> String showList :: [TError] -> ShowS
NFData TError Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: TError -> ()
Eq TError Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: TError -> TError -> Bool (/=) :: TError -> TError -> Bool
Ord TError Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: TError -> TError -> Ordering (<) :: TError -> TError -> Bool (<=) :: TError -> TError -> Bool (>) :: TError -> TError -> Bool (>=) :: TError -> TError -> Bool max :: TError -> TError -> TError min :: TError -> TError -> TError
type Rep TError Source #
Instance details Defined in Agda.Syntax.Treeless type Rep TError = D1 ('MetaData "TError" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) (C1 ('MetaCons "TUnreachable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TMeta" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))

data CaseType Source #

Constructors

CTData QName
CTNat
CTInt
CTChar
CTString
CTFloat
CTQName

Instances

Instances details

NamesIn CaseType Source #
Instance details Defined in Agda.Syntax.Internal.Names Methods namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> CaseType -> m Source #
Generic CaseType Source #
Instance details Defined in Agda.Syntax.Treeless Associated Types type Rep CaseType :: Type -> Type Methods from :: CaseType -> Rep CaseType x to :: Rep CaseType x -> CaseType
Show CaseType Source #
Instance details Defined in Agda.Syntax.Treeless Methods showsPrec :: Int -> CaseType -> ShowS show :: CaseType -> String showList :: [CaseType] -> ShowS
NFData CaseType Source #
Instance details Defined in Agda.Syntax.Treeless Methods rnf :: CaseType -> ()
Eq CaseType Source #
Instance details Defined in Agda.Syntax.Treeless Methods (==) :: CaseType -> CaseType -> Bool (/=) :: CaseType -> CaseType -> Bool
Ord CaseType Source #
Instance details Defined in Agda.Syntax.Treeless Methods compare :: CaseType -> CaseType -> Ordering (<) :: CaseType -> CaseType -> Bool (<=) :: CaseType -> CaseType -> Bool (>) :: CaseType -> CaseType -> Bool (>=) :: CaseType -> CaseType -> Bool max :: CaseType -> CaseType -> CaseType min :: CaseType -> CaseType -> CaseType
type Rep CaseType Source #
Instance details Defined in Agda.Syntax.Treeless type Rep CaseType = D1 ('MetaData "CaseType" "Agda.Syntax.Treeless" "Agda-2.6.4-inplace" 'False) ((C1 ('MetaCons "CTData" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: (C1 ('MetaCons "CTNat" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CTInt" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "CTChar" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CTString" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CTFloat" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CTQName" 'PrefixI 'False) (U1 :: Type -> Type))))

pattern TPOp :: TPrim -> TTerm -> TTerm -> TTerm Source #

pattern TPFn :: TPrim -> TTerm -> TTerm Source #

filterUsed :: [ArgUsage] -> [a] -> [a] Source #

filterUsed used args drops those args which are labelled ArgUnused in list used.

Specification:

  filterUsed used args = [ a | (a, ArgUsed) <- zip args $ used ++ repeat ArgUsed ]

Examples:

  filterUsed []                 == id
  filterUsed (repeat ArgUsed)   == id
  filterUsed (repeat ArgUnused) == const []

mkLet :: TTerm -> TTerm -> TTerm Source #

Introduces a new binding

isPrimEq :: TPrim -> Bool Source #

coerceView :: TTerm -> (Bool, TTerm) Source #

Strip leading coercions and indicate whether there were some.

mkTApp :: TTerm -> Args -> TTerm Source #

tAppView :: TTerm -> (TTerm, [TTerm]) Source #

coerceAppView :: TTerm -> ((Bool, TTerm), [TTerm]) Source #

Expose the format coerce f args.

We fuse coercions, even if interleaving with applications. We assume that coercion is powerful enough to satisfy coerce (coerce f a) b = coerce f a b

tLetView :: TTerm -> ([TTerm], TTerm) Source #

tLamView :: TTerm -> (Int, TTerm) Source #

mkTLam :: Int -> TTerm -> TTerm Source #

tInt :: Integer -> TTerm Source #

intView :: TTerm -> Maybe Integer Source #

word64View :: TTerm -> Maybe Word64 Source #

tPlusK :: Integer -> TTerm -> TTerm Source #

tOp :: TPrim -> TTerm -> TTerm -> TTerm Source #

tNegPlusK :: Integer -> TTerm -> TTerm Source #

plusKView :: TTerm -> Maybe (Integer, TTerm) Source #

negPlusKView :: TTerm -> Maybe (Integer, TTerm) Source #

tUnreachable :: TTerm Source #

tIfThenElse :: TTerm -> TTerm -> TTerm -> TTerm Source #