E.Type

The definitions related to jhc core

Documentation

data Comb

Constructors

Comb

Fields

combHead :: TVr

combBody :: E

combRules :: [Rule]

Instances

HasProperties Comb

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

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

data Lit e t

Constructors

LitInt

Fields

litNumber :: Number

litType :: t

LitCons

Fields

litName :: Name

litArgs :: [e]

litType :: t

litAliasFor :: Maybe E

Instances

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)

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

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

HasSize E

HasInfo TVr

HasProperties TVr

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

Show a => Show (TVr' a)

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)

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

Generated by DrIFT : Look, but Don't Touch. *

isLitInt :: Lit t t1 -> Bool

isLitCons :: Lit t t1 -> Bool

isEStar :: ESort -> Bool

isEBang :: ESort -> Bool

isEHash :: ESort -> Bool

isETuple :: ESort -> Bool

isEHashHash :: ESort -> Bool

isEStarStar :: ESort -> Bool

isESortNamed :: ESort -> Bool

isEAp :: E -> Bool

isELam :: E -> Bool

isEPi :: E -> Bool

isEVar :: E -> Bool

isUnknown :: E -> Bool

isESort :: E -> Bool

isELit :: E -> Bool

isELetRec :: E -> Bool

isEPrim :: E -> Bool

isEError :: E -> Bool

isECase :: E -> Bool

fromEAp :: Monad m => E -> m (E, E)

fromELam :: Monad m => E -> m (TVr, E)

fromEPi :: Monad m => E -> m (TVr, E)

fromEVar :: Monad m => E -> m TVr

fromUnknown :: Monad m => E -> m ()

fromESort :: Monad m => E -> m ESort

fromELit :: Monad m => E -> m (Lit E E)

fromELetRec :: Monad m => E -> m ([(TVr, E)], E)

fromEPrim :: Monad m => E -> m (Prim, [E], E)

fromEError :: Monad m => E -> m (String, E)

fromECase :: Monad m => E -> m (E, E, TVr, [Alt E], Maybe E, IdSet)

tvrIdent_u :: (Id -> Id) -> TVr' e -> TVr' e

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

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

tvrIdent_s :: Id -> TVr' e -> TVr' e

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

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