| Safe Haskell | None |
|---|
Data.Logic.Types.Harrison.Formulas.FirstOrder
Documentation
Constructors
| F | |
| T | |
| Atom a | |
| Not (Formula a) | |
| And (Formula a) (Formula a) | |
| Or (Formula a) (Formula a) | |
| Imp (Formula a) (Formula a) | |
| Iff (Formula a) (Formula a) | |
| Forall String (Formula a) | |
| Exists String (Formula a) |
Instances
| Eq a => Eq (Formula a) | |
| Ord a => Ord (Formula a) | |
| Show (Formula FOLEQ) | |
| Negatable (Formula atom) | |
| HasFixity (Formula FOLEQ) | |
| FirstOrderFormula (Formula a) a String => Pretty (Formula a) | |
| Combinable (Formula a) | |
| Constants (Formula a) | |
| (Constants a, Pretty a, HasFixity a) => Formula (Formula a) a | |
| Formula (Formula FOLEQ) FOLEQ => PropositionalFormula (Formula FOLEQ) FOLEQ | |
| Formula (Formula FOLEQ) FOLEQ => Literal (Formula FOLEQ) FOLEQ | |
| (Formula (Formula a) a, Constants a, Pretty a, HasFixity a) => FirstOrderFormula (Formula a) a String |