The Whiley Theorem Prover (WyTP) is an automatic and interactive theorem prover designed to discharge verification conditions generated by the Whiley Compiler. WyTP operates over a variant of first-order logic which includes integer arithmetic, arrays and quantification.
Currently,
RecordEqualityCaseAnalysis
could perform more simplification as it is constructing new terms. As an example, consider this:This produces the following proof:
We can see that when
Req-C
is applied it produces unsimplified expressions of the form{x: 1, y: 2}.x
.