logic-classes-1.5.1: Framework for propositional and first order logic, theorem proving

Safe HaskellNone
LanguageHaskell98

Data.Logic.Types.Harrison.Formulas.Propositional

Documentation

data Formula a Source

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) 

Instances

Eq a => Eq (Formula a) 
Ord a => Ord (Formula a) 
Show (Formula String) 
Show (Formula Prop) 
Negatable (Formula atom) 
(Pretty atom, HasFixity atom, Ord atom) => HasFixity (Formula atom) 
(Pretty atom, HasFixity atom, Ord atom) => Pretty (Formula atom) 
Combinable (Formula a) 
Constants (Formula a) 
(Pretty atom, HasFixity atom, Ord atom) => Formula (Formula atom) atom 
(Combinable (Formula atom), Pretty atom, HasFixity atom, Ord atom) => PropositionalFormula (Formula atom) atom 
(HasFixity atom, Pretty atom, Ord atom) => Literal (Formula atom) atom