Language.Hakaru.Parser.SymbolResolve

Documentation

data Symbol a

Constructors

TLam (a -> Symbol a)

TNeu a

data Symbol' a

Constructors

TLam' ([a] -> a)

TNeu' a

singleton :: a -> NonEmpty a

primPat :: [(Text, Symbol' Pattern)]

pairPat :: Pattern -> Pattern -> Pattern

primTypes :: [(Text, Symbol' SSing)]

t2 :: (AST -> AST -> AST) -> Symbol AST

t3 :: (AST -> AST -> AST -> AST) -> Symbol AST

type SymbolTable = [(Text, Symbol AST)]

primTable :: SymbolTable

primPrimOp0 :: PrimOp -> Symbol AST

primPrimOp1 :: PrimOp -> Symbol AST

primPrimOp2 :: PrimOp -> Symbol AST

primMeasure1 :: SomeOp MeasureOp -> Symbol AST

primMeasure2 :: SomeOp MeasureOp -> Symbol AST

primCoerce :: Coercion a b -> Symbol AST

primUnsafe :: Coercion a b -> Symbol AST

cProb2Real :: Coercion HProb HReal

cNat2Prob :: Coercion HNat HProb

cNat2Int :: Coercion HNat HInt

cInt2Real :: Coercion HInt HReal

cNat2Real :: Coercion HNat HReal

unit_ :: AST

true_ :: AST

false_ :: AST

unsafeFrom_ :: AST -> AST

primLeft :: Symbol AST

primRight :: Symbol AST

primJust :: Symbol AST

primNothing :: Symbol AST

primWeight :: Symbol AST

primFactor :: Symbol AST

two :: AST

gensym :: Text -> State Int Name

mkSym :: Name -> Symbol AST

insertSymbol :: Name -> SymbolTable -> SymbolTable

insertSymbols :: [Name] -> SymbolTable -> SymbolTable

resolveBinder :: SymbolTable -> Text -> AST' Text -> AST' Text -> (Symbol AST -> AST' (Symbol AST) -> AST' (Symbol AST) -> AST' (Symbol AST)) -> State Int (AST' (Symbol AST))

symbolResolution :: SymbolTable -> AST' Text -> State Int (AST' (Symbol AST))

Figure out symbols and types.

symbolResolutionReducer :: SymbolTable -> Reducer' Text -> State Int (Reducer' (Symbol AST))

symbolResolveBranch :: SymbolTable -> Branch' Text -> State Int (Branch' (Symbol AST))

symbolResolvePat :: Pattern' Text -> State Int (Pattern' Name, [Name])

normAST :: AST' (Symbol AST) -> AST' (Symbol AST)

Make AST and give unique names for variables.

The logic here is to do normalization by evaluation for our primitives. App inspects its first argument to see if it should do something special. Otherwise App behaves as normal.

branchNorm :: Branch' (Symbol AST) -> Branch' (Symbol AST)

redNorm :: Reducer' (Symbol AST) -> Reducer' (Symbol AST)

collapseSuperposes :: [AST] -> AST

makeType :: TypeAST' -> SSing

makePattern :: Pattern' Name -> Pattern

makeBranch :: Branch' (Symbol AST) -> Branch

makeTrue :: AST' (Symbol AST) -> Branch

makeFalse :: AST' (Symbol AST) -> Branch

makeReducerAST :: Variable U -> Reducer' (Symbol AST) -> List1 Variable xs -> Reducer xs U_ABT U

makeAST :: AST' (Symbol AST) -> AST

withName :: String -> Symbol AST -> (Variable U -> r) -> r

resolveAST :: AST' Text -> AST

resolveAST' :: [Name] -> AST' Text -> AST

makeName :: SomeVariable (KProxy :: KProxy Hakaru) -> Name

fromVarSet :: VarSet (KProxy :: KProxy Hakaru) -> [Name]