| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Bricks.BuiltinFunctions
- term'data :: forall a. Typeable a => Type a -> a -> Term
- fn'pure'parametric'arity1 :: (Term -> Term) -> Term
- fn'pure'parametric'arity2 :: (Term -> Term -> Term) -> Term
- fn'pure'parametric'arity3 :: (Term -> Term -> Term -> Term) -> Term
- fn'id :: Term
- fn'const :: Term
- fn'comp :: Term
- fn'flip :: Term
- fn'dict'lookup :: Term
- fn'or :: Term
- fn'and :: Term
- fn'string'append :: Term
- fn'dict'disallowExtraKeys :: Set Text -> Term
- fn'dict'merge'preferLeft :: Term
- fn'dict'merge'preferRight :: Term
- cast'data :: (MonadEval m, Typeable a) => Type a -> Term -> m a
- assert'type :: Typeable a => Type a -> Term
- req :: forall a b m. (MonadEval m, Typeable a) => ((a, Term) -> b) -> Type a -> Term -> m b
- fn'int'add :: Term
- fn'int'constructor :: Term
- standard'library :: Term
Documentation
Function composition, in the traditional "backwards" order.
Read f as "f after g." fn'comp g
assert'type :: Typeable a => Type a -> Term Source #
Like fn'id, but fails if the argument is not of the given type.
req :: forall a b m. (MonadEval m, Typeable a) => ((a, Term) -> b) -> Type a -> Term -> m b Source #
fn'int'add :: Term Source #