diff options
| author |  letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2009-07-22 16:24:37 +0000 |
|---|---|---|
| committer | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2009-07-22 16:24:37 +0000 |
| commit | 810d1013f4e554bacd096800d4282c239ed59455 (patch) | |
| tree | a1cb1c85941cc8d393fac8b499b56b60511e2ccb /test-suite/micromega/qexample.v | |
| parent | d516c922b388411c46f9046ffe6df99b4061f33b (diff) | |
Better comparison functions in OrderedTypeEx
The compare functions are still functions-by-tactics, but now their
computational parts are completely pure (no use of lt_eq_lt_dec in
nat_compare anymore), while their proofs parts are simply calls
to (opaque) lemmas. This seem to improve the efficiency of sets/maps,
as mentionned by T. Braibant, D. Pous and S. Lescuyer.
The earlier version of nat_compare is now called nat_compare_alt,
there is a proof of equivalence named nat_compare_equiv.
By the way, various improvements of proofs, in particular in Pnat.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12247 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'test-suite/micromega/qexample.v')
0 files changed, 0 insertions, 0 deletions