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

Safe HaskellNone
LanguageHaskell98

Data.Logic.Harrison.PropExamples

Documentation

data Atom a Source

Constructors

P String a (Maybe a) 

Instances

Eq a => Eq (Atom a) 
Ord a => Ord (Atom a) 
Show (Formula (Atom Int)) 
Show a => Show (Atom a) 
HasFixity (Atom N) 
Pretty (Atom N) 
NumAtom (Atom N) 

type N = Int Source

prime :: forall formula. (PropositionalFormula formula (Atom N), Ord formula) => N -> formula Source

ramsey :: forall formula. (PropositionalFormula formula (Atom N), Ord formula) => Int -> Int -> N -> formula Source