E.Type

The definitions related to jhc core

Documentation

data Comb

Constructors

Comb

Fields

combHead :: TVr

combBody :: E

combRules :: [Rule]

Instances

HasProperties Comb

FreeVars Comb IdSet

FreeVars Comb [Id]

combBody_u :: (E -> E) -> Comb -> Comb

combHead_u :: (TVr -> TVr) -> Comb -> Comb

combRules_u :: ([Rule] -> [Rule]) -> Comb -> Comb

combBody_s :: E -> Comb -> Comb

combHead_s :: TVr -> Comb -> Comb

combRules_s :: [Rule] -> Comb -> Comb

emptyComb :: Comb

combIdent :: Comb -> Id

combArgs :: Comb -> [TVr]

combABody :: Comb -> E

combBind :: Comb -> (TVr, E)

bindComb :: (TVr, E) -> Comb

combTriple :: Comb -> (TVr, [TVr], E)

combTriple_s :: (TVr, [TVr], E) -> Comb -> Comb

data RuleType

Constructors

RuleSpecialization

RuleUser

RuleCatalyst

Instances

Eq RuleType

Binary RuleType

data Rule

Constructors

Rule

Fields

ruleHead :: TVr

ruleBinds :: [TVr]

ruleArgs :: [E]

ruleNArgs :: !Int

ruleBody :: E

ruleType :: RuleType

ruleUniq :: (Module, Int)

ruleName :: Atom

Instances

Eq Rule

Show Rule

Binary Rule

FreeVars Rule IdSet

we delete the free variables of the heads of a rule from the rule's free variables. the reason for doing this is that the rule cannot fire if all its heads are in scope, and if it were not done then many functions seem recursive when they arn't actually.

FreeVars Rule [Id]

data ARules

Constructors

ARules

Fields

aruleFreeVars :: IdSet

aruleRules :: [Rule]

Instances

Show ARules

ARules contains a set of rules for a single id, optimized for fast application

invarients for ARules sorted by number of arguments rule takes all hidden rule fields filled in free variables are up to date

Monoid ARules

Binary ARules

FreeVars ARules IdSet

data Lit e t

Constructors

LitInt

Fields

litNumber :: Number

litType :: t

LitCons

Fields

litName :: Name

litArgs :: [e]

litType :: t

litAliasFor :: Maybe E

Instances

PPrint String (Lit E E)

Functor (Lit e)

Foldable (Lit e)

Traversable (Lit e)

(Eq e, Eq t) => Eq (Lit e t)

(Ord e, Ord t) => Ord (Lit e t)

(Show e, Show t) => Show (Lit e t)

(Binary e, Binary t) => Binary (Lit e t)

ConNames (Lit E E)

CanType (Lit x t)

FreeVars E x => FreeVars (Lit TVr E) x

data ESort

Constructors

EStar

the sort of boxed lazy types

EBang

the sort of boxed strict types

EHash

the sort of unboxed types

ETuple

the sort of unboxed tuples

EHashHash

the supersort of unboxed types

EStarStar

the supersort of boxed types

ESortNamed Name

user defined sorts

Instances

Eq ESort

Ord ESort

Show ESort

Binary ESort

CanType ESort

data E

Constructors

EAp E E

ELam TVr E

EPi TVr E

EVar TVr

Unknown

ESort ESort

ELit !(Lit E E)

ELetRec

Fields

eDefs :: [(TVr, E)]

eBody :: E

EPrim Prim [E] E

EError String E

ECase

Fields

eCaseScrutinee :: E

eCaseType :: E

eCaseBind :: TVr

eCaseAlts :: [Alt E]

eCaseDefault :: Maybe E

eCaseAllFV :: IdSet

Instances

Eq TVr

Eq E

Ord TVr

Ord E

Show E

Binary TVr

Binary E

Tuple E

HasSize E

ConNames E

TypeNames E

HasInfo TVr

HasProperties TVr

ToCmmTy E

CanType TVr

CanType E

ToVal TVr

FreeVars E t => FreeVars TVr t

FreeVars TVr IdSet

determine free variables of a binding site

FreeVars E IdSet

PPrint String E

DocLike d => PPrint d TVr

PPrint Doc E

Expression E E

FreeVars E [Id]

FreeVars E [TVr]

FreeVars E (IdMap (Maybe E))

FreeVars E (IdMap TVr)

PPrint String (Lit E E)

FreeVars (Alt E) IdSet

FreeVars (Alt E) (IdMap TVr)

ConNames (Lit E E)

FreeVars E x => FreeVars (Lit TVr E) x

type TVr = TVr' E

data TVr' e

Constructors

TVr

Fields

tvrIdent :: !Id

tvrType :: e

tvrInfo :: Info

Instances

Eq TVr

Functor TVr'

Ord TVr

Foldable TVr'

Traversable TVr'

Binary TVr

HasInfo TVr

HasProperties TVr

CanType TVr

ToVal TVr

FreeVars E t => FreeVars TVr t

FreeVars TVr IdSet

determine free variables of a binding site

DocLike d => PPrint d TVr

FreeVars E [TVr]

FreeVars E (IdMap TVr)

Show a => Show (TVr' a)

FreeVars (Alt E) (IdMap TVr)

FreeVars E x => FreeVars (Lit TVr E) x

tvrInfo_u :: (Info -> Info) -> TVr' e -> TVr' e

tvrType_u :: (t -> e) -> TVr' t -> TVr' e

tvrInfo_s :: Info -> TVr' e -> TVr' e

tvrType_s :: e -> TVr' t -> TVr' e

data Alt e

Constructors

Alt (Lit TVr e) e

Instances

Eq e => Eq (Alt e)

Ord e => Ord (Alt e)

Show e => Show (Alt e)

Binary e => Binary (Alt e)

CanType e => CanType (Alt e)

FreeVars (Alt E) IdSet

FreeVars (Alt E) (IdMap TVr)

altHead :: Alt E -> Lit () ()

litHead :: Lit a b -> Lit () ()

litBinds :: Lit t t1 -> [t]

patToLitEE :: Lit TVr E -> E

caseBodies :: E -> [E]

casePats :: E -> [Lit TVr E]

caseBinds :: E -> [TVr]

fromAp :: E -> (E, [E])

extract out EAp nodes a value and the arguments it is applied to.

fromPi :: E -> (E, [TVr])

deconstruct EPi terms, getting function argument types.

fromLam :: E -> (E, [TVr])

deconstruct ELam term.

litCons :: Lit e t

eStar :: E

eHash :: E

tVr :: Id -> e -> TVr' e

tvr :: TVr' E

isLitCons :: forall e_1629244139 t_1629244140. Lit e_1629244139 t_1629244140 -> Bool

isLitInt :: forall e_1629244139 t_1629244140. Lit e_1629244139 t_1629244140 -> Bool

isESortNamed :: ESort -> Bool

isEStarStar :: ESort -> Bool

isEHashHash :: ESort -> Bool

isETuple :: ESort -> Bool

isEHash :: ESort -> Bool

isEBang :: ESort -> Bool

isEStar :: ESort -> Bool

isECase :: E -> Bool

isEError :: E -> Bool

isEPrim :: E -> Bool

isELetRec :: E -> Bool

isELit :: E -> Bool

isESort :: E -> Bool

isUnknown :: E -> Bool

isEVar :: E -> Bool

isEPi :: E -> Bool

isELam :: E -> Bool

isEAp :: E -> Bool

fromECase :: E -> (E, E, TVr' E, [Alt E], Maybe E, IntjectionSet Id)

fromEError :: E -> ([Char], E)

fromEPrim :: E -> (Prim, [E], E)

fromELetRec :: E -> ([(TVr' E, E)], E)

fromELit :: E -> Lit E E

fromESort :: E -> ESort

fromUnknown :: E -> ()

fromEVar :: E -> TVr' E

fromEPi :: E -> (TVr' E, E)

fromELam :: E -> (TVr' E, E)

fromEAp :: E -> (E, E)