Folly: A first order logic library in Haskell

[ bsd3, library, program, theorem-provers ] [ Propose Tags ]

An implementation of first order logic in Haskell that includes a library of modules for incorporating first order logic into other programs as well as an executable theorem prover that uses resolution to prove theorems in first order logic.

Versions [RSS] [faq] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0, 0.1.4.1, 0.1.4.2, 0.1.4.3, 0.1.4.4, 0.1.4.6, 0.1.5.0, 0.1.5.1, 0.1.5.2, 0.2.0.0, 0.2.0.1
Dependencies base (<6), containers, HUnit, parsec [details]
License BSD-3-Clause
Author Dillon Huff
Maintainer Dillon Huff
Home page https://github.com/dillonhuff/Folly
Uploaded by dillonhuff at 2015-08-30T21:18:52Z
Distributions NixOS:0.2.0.1
Executables Folly-tests, Folly
Downloads 9860 total (73 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-12-01 [all 6 reports]

Modules

  • Folly
    • Folly.Formula
    • Folly.Lexer
    • Folly.Parser
    • Folly.Resolution
    • Folly.Theorem
    • Folly.Unification
    • Folly.Utils

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates