GitLab

illustrates the new typing system of WhyML
with a mutable field containing a mutable data structure

the main program is transformed into a test of compute_sums.
It seems that the metas are not needed anymore.

(we do not have to use the ghost construct here, but it looks nicer)

Replaying programs/vacid_0_binary_heaps/proofs ... FAILED (ret code=1): 37/38 (replay failed)
   goal 'WP_parameter heapSort.10', prover 'Eprover (1.4)': Timeout (9.97s) instead of Valid (2.93s) (timelimit=10)
   goal 'Is_heap_when_no_element', prover 'Spass (3.7)': Timeout (13.00s) instead of Valid (5.61s) (timelimit=13)

Remove axioms from int.Power realization.

Almost all of them are one-liner changes to account for the additional hypotheses.