The g4ip package

[Tags:library, mit, test]

[Skip to Readme]

Properties

Versions 0.1.0.0
Dependencies base (==4.6.*) [details]
License MIT
Author Josh Acay
Maintainer coskuacay@gmail.com
Category Logic
Home page https://github.com/cacay/G4ip
Uploaded Mon Mar 20 22:01:29 UTC 2017 by cacay
Distributions NixOS:0.1.0.0
Downloads 58 total (14 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
All reported builds failed as of 2017-03-20 [all 3 reports]
Hackage Matrix CI

Modules

  • G4ip
    • G4ip.Decider
    • G4ip.Proposition

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for g4ip

Readme for g4ip-0.1.0.0

G4ip

Implementation of a theorem prover for propositional logic using G4ip in Haskell.

File Structure

  • G4ip/Proposition.hs -- Definition of propositions and some syntactic sugar
  • G4ip/Decider.hs -- The actual theorem prover (decider?)
  • G4ip/Tester.hs -- For defining and running tests
  • G4ip/TestMain.hs -- Actually runs the default test suite

Testing Manually

  • Startup ghci
  • Load Main.hs by typing :l Main
  • Use decide prop to see if prop is provable.

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:

decide $ (neg b ==> neg a) ==> (a ==> b) \/ (a \/ a ==> a)

which prints True as expected ($ if for associativity, you can use parenthesis if you want).

Contact

Email me at coskuacay@gmail.com for any questions.