Contents:
BoolSpec
-based decidability typeclasses. Allows one to write if MyType_eqb a b then ... else ...
where MyType_eqb a b
returns a bool
, instead of writing if MyType_eq_dec a b then ... else ...
where MyType_eq_dec a b
returns a sumbool
, while still getting a = b
and a <> b
as hypotheses (as opposed to MyType_eqb a b = true
and MyType_eqb a b = false
) after destructing the if
(need to use destr
instead of destruct
). So one gets the benefits of Sumbool
without getting its disadvantage of having to carry around proof terms, which can cause a blow-up under reduction if one is not careful.replace mapA with mapB
if one can prove that mapA
and mapB
have the same contents. Comes with a solver which works reasonably fast on most map goals we have encountered so far.Z
type from Coq's standard library, including a tactic to prove Z
equalities by splitting the equality into equalities on bit index ranges, a tactic to make lia
capable of reasoning about goals with division and modulo, and a tactic to simplify expressions containing nested occurrences of mod
, and more misc utilities.Each feature is intended to be as minimal and as independent of the other features as possible, so that users can pick just what they need.