Published March 16, 2023
| Version v1.7.0
Software
Open
scala-tptp-parser v1.7.0
Description
scala-tptp-parser is a Scala library (for Scala 2.13.x) for parsing the input languages of the TPTP infrastructure.
The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, the parser supports:
- THF (TH0/TH1): Monomorphic and polymorphic higher-order logic,
- TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, including extended TFF (TFX),
- FOF: Untyped first-order logic,
- TCF: Typed clause-normal form,
- CNF: (Untyped) clause-normal form,
- TPI: TPTP Process Instruction language, and
- NXF/NHF: the new (partly experimental) non-classical TPTP languages based on TXF resp. THF.
Version 1.7.0 of the scala-tptp-parser library.
Updates:
- Rework non-classical formulas in TFF and THF, so that both languages now have their dedicated case class for non-classical formulas, called
NonclassicalPolyaryFormula. This breaks a few things from previous versions (new formula structure for NCL formulas). - Also, the NCL short-form connectives
[.]and<.>are now unary connectives (and can be used as such). The long-form connectives{name}still require an explicit application with@.
See the README for further information.
Files
leoprover/scala-tptp-parser-v1.7.0.zip
Files
(80.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a5f1491334ed48500d9fd8fdf1e68db1
|
80.8 kB | Preview Download |
Additional details
Related works
- Is supplement to
- https://github.com/leoprover/scala-tptp-parser/tree/v1.7.0 (URL)