| Package | Description |
|---|---|
| wytp.proof | |
| wytp.proof.rules | |
| wytp.proof.rules.arithmetic | |
| wytp.proof.rules.array | |
| wytp.proof.rules.quantifier | |
| wytp.proof.rules.type | |
| wytp.proof.util |
| Modifier and Type | Method and Description |
|---|---|
Proof.Delta.Set |
Proof.Delta.Set.add(Formula truth)
Add a truth to this set.
|
Proof.Delta.Set |
Proof.Delta.getAdditions()
Get the set of truths added to this delta
|
Proof.Delta.Set |
Proof.Delta.getRemovals()
Get the set of truths removed from this delta
|
Proof.Delta.Set |
Proof.Delta.Set.remove(Formula truth)
Remove a formula from this set
|
Proof.Delta.Set |
Proof.Delta.Set.remove(Proof.Delta.Set other)
Remove the elements of one set from this
|
Proof.Delta.Set |
Proof.Delta.Set.union(Proof.Delta.Set other)
Union two sets together
|
| Modifier and Type | Method and Description |
|---|---|
Proof.Delta.Set |
Proof.Delta.Set.remove(Proof.Delta.Set other)
Remove the elements of one set from this
|
Proof.Delta.Set |
Proof.Delta.Set.union(Proof.Delta.Set other)
Union two sets together
|
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
CongruenceClosure.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
wybs.lang.SyntacticItem |
CongruenceClosure.construct(Proof.Delta.Set existingTruths,
Proof.State head,
wybs.lang.SyntacticItem term,
Formula newTruth,
List<Formula> dependencies)
When generating an entirely new term within a given rule (i.e.
|
WyalFile.Expr |
CongruenceClosure.localConstruct(Proof.Delta.Set existingTruths,
Proof.State head,
WyalFile.Expr term,
Formula newTruth,
List<Formula> dependencies) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
InequalityIntroduction.apply(Proof.Delta.Set existingTruths,
Proof.State state,
Formula newTruth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
ArrayIndexAxiom.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula truth) |
Proof.State |
ArrayIndexAxiom.attemptInstantiationByArrayAccess(Formula truth,
Proof.Delta.Set existingTruths,
Proof.State state) |
Proof.State |
ArrayIndexAxiom.attemptInstantiationByEquation(Formula truth,
Proof.Delta.Set existingTruths,
Proof.State state) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
ExhaustiveQuantifierInstantiation.apply(Proof.Delta.Set existingTruths,
Proof.State state,
Formula newTruth) |
| Modifier and Type | Method and Description |
|---|---|
Proof.State |
TypeTestNormalisation.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
Proof.State |
TypeTestClosure.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula newTruth) |
| Modifier and Type | Class and Description |
|---|---|
static class |
FastDelta.Set |
| Modifier and Type | Method and Description |
|---|---|
protected Proof.Delta.Set |
AbstractClosureRule.getExistingTruths(Proof.State current) |
| Modifier and Type | Method and Description |
|---|---|
abstract Proof.State |
AbstractClosureRule.apply(Proof.Delta.Set existingTruths,
Proof.State head,
Formula truth) |
FastDelta.Set |
FastDelta.Set.remove(Proof.Delta.Set other) |
FastDelta.Set |
FastDelta.Set.union(Proof.Delta.Set other) |
Copyright © 2017. All rights reserved.