| Copyright | (c) 2021 Rudy Matela |
|---|---|
| License | 3-Clause BSD (see the file LICENSE) |
| Maintainer | Rudy Matela <rudy@matela.com.br> |
| Safe Haskell | None |
| Language | Haskell2010 |
Conjure.Prim
Description
Synopsis
- type Prim = (Expr, Reification)
- prim :: Conjurable a => String -> a -> Prim
- pr :: (Conjurable a, Show a) => a -> Prim
- prif :: Conjurable a => a -> Prim
- cjHoles :: [Prim] -> [Expr]
- cjTiersFor :: [Prim] -> Expr -> [[Expr]]
- cjAreEqual :: [Prim] -> Int -> Expr -> Expr -> Bool
- cjMkEquation :: [Prim] -> Expr -> Expr -> Expr
Documentation
type Prim = (Expr, Reification) Source #
A primtive expression (paired with instance reification).
prif :: Conjurable a => a -> Prim Source #
Provides an if condition bound to the given return type.