Clash.GHC.Evaluator

Call-by-need evaluator based on the evaluator described in:

Maximilian Bolingbroke, Simon Peyton Jones, "Supercompilation by evaluation", Haskell '10, Baltimore, Maryland, USA.

Documentation

evaluator :: Evaluator

stepVar :: Id -> Step

stepData :: DataCon -> Step

stepLiteral :: Literal -> Step

stepPrim :: PrimInfo -> Step

stepLam :: Id -> Term -> Step

stepTyLam :: TyVar -> Term -> Step

stepApp :: Term -> Term -> Step

stepTyApp :: Term -> Type -> Step

stepLet :: Bind Term -> Term -> Step

stepCase :: Term -> Type -> [Alt] -> Step

stepCast :: Term -> Type -> Type -> Step

stepTick :: TickInfo -> Term -> Step

ghcStep :: Step

Small-step operational semantics.

newBinder :: [Either TyVar Type] -> Term -> Step

Take a list of types or type variables and create a lambda / type lambda for each one around the given term.

newLetBinding :: TyConMap -> Machine -> Term -> (Machine, Id)

ghcUnwind :: Unwind

Unwind the stack by 1

update :: IdScope -> Id -> Value -> Machine -> Machine

Update the Heap with the evaluated term

apply :: TyConMap -> Value -> Id -> Machine -> Machine

Apply a value to a function

instantiate :: TyConMap -> Value -> Type -> Machine -> Machine

Instantiate a type-abstraction

scrutinise :: Value -> Type -> [Alt] -> Machine -> Machine

Evaluate a case-expression

substInAlt :: DataCon -> [TyVar] -> [Id] -> [Either Term Type] -> Term -> Term

allocate :: [LetBinding] -> Term -> Machine -> Machine

Allocate let-bindings on the heap

letSubst :: PureHeap -> Supply -> Id -> (Supply, (Id, (Id, Term)))

Create a unique name and substitution for a let-binder