For package maintainers and hackage trustees
Implementation of a theorem prover for propositional logic using G4ip in Haskell.
You can use T, F, /\, \/, ==>, <==, <=>, neg, and () with their usual meanings to form propositions. To form an atom, either use Atom "name" or use one of the predefined atoms: a, b, c, d, e, or f. Here is an example:
which prints True as expected ($ if for associativity, you can use parenthesis if you want).
Email me at coskuacay@gmail.com for any questions.