Copyright | (c) Masahiro Sakai 2011-2015 |
---|---|
License | BSD-style |
Maintainer | masahiro.sakai@gmail.com |
Stability | provisional |
Portability | non-portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Extensions |
|
ToySolver.Data.FOL.Formula
Description
Formula of first order logic.
Overloaded operations for formula.
module ToySolver.Data.Boolean
Concrete formula
formulas of first order logic
Constructors
T | |
F | |
Atom a | |
And (Formula a) (Formula a) | |
Or (Formula a) (Formula a) | |
Not (Formula a) | |
Imply (Formula a) (Formula a) | |
Equiv (Formula a) (Formula a) | |
Forall Var (Formula a) | |
Exists Var (Formula a) |
Instances
Show a => Show (Formula a) Source # | |
Eq a => Eq (Formula a) Source # | |
Ord a => Ord (Formula a) Source # | |
Boolean (Formula c) Source # | |
Complement (Formula a) Source # | |
MonotoneBoolean (Formula c) Source # | |
Variables a => Variables (Formula a) Source # | |
IfThenElse (Formula c) (Formula c) Source # | |
IsEqRel (Expr c) (Formula (Atom c)) Source # | |
IsOrdRel (Expr c) (Formula (Atom c)) Source # | |
Defined in ToySolver.Data.FOL.Arith |