tptp: Parser and pretty printer for the TPTP language
[ formal-methods, gpl, language, library, parsing, pretty-printer, theorem-provers ]
[ Propose Tags ]
TPTP (Thousands of Problems for Theorem Provers) is the standard language of problems, proofs, and models, used by automated theorem provers.
This library provides definitions of data types, a pretty printer and an attoparsec parser for the CNF, FOF, TFF0 and TFF1 subsets of TPTP.
Modules
[Index] [Quick Jump]
Flags
Manual Flags
| Name | Description | Default |
|---|---|---|
| werror | Build with -Werror | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- tptp-0.1.3.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.1.0, 0.1.2.0, 0.1.3.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | attoparsec (>=0.13.2 && <0.14), base (>=4.7 && <5.0), prettyprinter (>=1.2.1 && <1.5), scientific (>=0.3.1 && <0.4), semigroups (>=0.16.1 && <1.0), text (>=1.2.3 && <1.3) [details] |
| License | GPL-3.0-only |
| Author | Evgenii Kotelnikov |
| Maintainer | evgeny.kotelnikov@gmail.com |
| Category | Language, Parsing, Pretty Printer, Theorem Provers, Formal Methods |
| Home page | https://github.com/aztek/tptp |
| Bug tracker | https://github.com/aztek/tptp/issues |
| Source repo | head: git clone git://github.com/aztek/tptp.git |
| Uploaded | by EK at 2021-01-11T14:39:51Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 2267 total (18 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2021-01-11 [all 1 reports] |