| Copyright | (c) Evgenii Kotelnikov 2019-2021 |
|---|---|
| License | GPL-3 |
| Maintainer | evgeny.kotelnikov@gmail.com |
| Stability | experimental |
| Safe Haskell | None |
| Language | Haskell2010 |
ATP.Pretty.FOL
Contents
Description
Pretty-printers for formulas, theorems and proofs.
Documentation
The member prettyList is only used to define the instance Pretty
a => Pretty [a]. In normal circumstances only the pretty function
is used.
Minimal complete definition
Instances
Orphan instances
| Pretty Error Source # | |
| Pretty Theorem Source # | |
| Pretty LogicalExpression Source # | |
| Pretty Formula Source # | |
| Pretty Connective Source # | |
| Pretty Quantifier Source # | |
| Pretty Clauses Source # | |
| Pretty Clause Source # | |
| Pretty Literal Source # | |
| Pretty PredicateSymbol Source # | |
| Pretty Term Source # | |
| Pretty FunctionSymbol Source # | |
| Pretty Solution Source # | |
| Pretty RuleName Source # | |
| Pretty a => Pretty (Partial a) Source # | |
| Pretty (Signed Literal) Source # | |
| (Ord l, Pretty l) => Pretty (Refutation l) Source # | |
| (Ord l, Pretty l) => Pretty (Derivation l) Source # | |
| Pretty l => Pretty (Sequent l) Source # | |
| Pretty l => Pretty (Inference l) Source # | |
| Pretty l => Pretty (Rule l) Source # | |