All Classes and Interfaces

Class
Description
An abbreviation.
A constant-application expression.
A compose proof takes statements x, y, ..., each with hypotheses Hx1, Hx2, ... and conclusion Cx, ..., and a statement with exactly the same hypotheses Cx, Cy, ... and conclusion C: it 'applies' the latter statement, by constructing the statement with hypotheses Hx1, Hx2, ..., Hy1, Hy2, ..., and conclusion C.
A set of 'distinct variable restrictions', each of which is an unordered pair of different variable names.
A proof which wraps another proof, and expands all that proof's abbreviations.
This class represents an expression, i.e., either a variable, or a constant applied to a list of subexpressions.
An internal version of an Expression.
An object that can wrap an Expression.Internal up as an Expression.
A justification gives a ProofStep that constructs a statement, and a Proof that constructs all prerequisites of the proof step.
The common base class for all MEPK-related exceptions.
This exception indicates that a String could not be parsed to an Expression, a Statement, or a Set of Statements.
Parsers for expressions, etc.
This exception indicates that a Proof did not Proof.verify() correctly.
A 'parallel proof' merges two proofs 'in parallel', so that the new proof just collects everything which the two parts prove.
A proof is a recipe for constructing one set of statements from another using only ProofSteps.
A proof step is the smallest step in a proof: it shows how to create a new statement from existing ones.
An internal version of a ProofStep.
A 'sequential proof' merges two proofs 'in sequence', where the second proof builds on the second one.
This class represents an statement.
The state that is kept while expanding an Abbreviation throughout a Statement.
A substitution proof step takes a statement, and constructs a structurally similar statement by substituting one variable for a (typed) expression.
A trivial proof grounds exactly its grounding statements, and therefore it does not have to construct anything.
A proof which trivially grounds exactly its grounding statements.
A trusted proof is a Proof which is built on the trusted kernel.
An internal version of a TrustedProof.
A helper class for easily creating a Map<String,String>, which maps variable names to type expressions.
A HashMap<String,String> mapping variables to type expressions.
A variable expression.
A weakening proof step constructs a new statement by adding DVRs and/or hypotheses to an existing statement.