Safe Haskell | Safe-Inferred |
---|---|
Language | GHC2021 |
Synopsis
- unwrapLamAbs :: Index -> Term name uni fun ann -> (Index, Term name uni fun ann)
- unwrapBindings :: [Term name uni fun ann] -> Term name uni fun ann -> ([Term name uni fun ann], Term name uni fun ann)
- unwrapApply :: [Term name uni fun ann] -> Term name uni fun ann -> ([Term name uni fun ann], Term name uni fun ann)
- incrVar :: Term DeBruijn uni fun () -> Term DeBruijn uni fun ()
- pattern PFixAst :: Term name uni fun ()
- pattern ComposeAST :: Term DeBruijn uni fun () -> Term DeBruijn uni fun () -> Term DeBruijn uni fun ()
- pattern IfThenElseLikeAST :: Term name uni fun () -> Term name uni fun () -> Term name uni fun () -> Term name uni fun () -> Term name uni fun ()
Documentation
unwrapLamAbs :: Index -> Term name uni fun ann -> (Index, Term name uni fun ann) Source #
unwrapBindings :: [Term name uni fun ann] -> Term name uni fun ann -> ([Term name uni fun ann], Term name uni fun ann) Source #
unwrapApply :: [Term name uni fun ann] -> Term name uni fun ann -> ([Term name uni fun ann], Term name uni fun ann) Source #
incrVar :: Term DeBruijn uni fun () -> Term DeBruijn uni fun () Source #
Increment the debruijn index of a Var
, leave any other AST node unchanged.
pattern ComposeAST :: Term DeBruijn uni fun () -> Term DeBruijn uni fun () -> Term DeBruijn uni fun () Source #
pattern IfThenElseLikeAST :: Term name uni fun () -> Term name uni fun () -> Term name uni fun () -> Term name uni fun () -> Term name uni fun () Source #