From 810d1013f4e554bacd096800d4282c239ed59455 Mon Sep 17 00:00:00 2001
From: letouzey
Date: Wed, 22 Jul 2009 16:24:37 +0000
Subject: 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
---
 CHANGES | 3 +++
 1 file changed, 3 insertions(+)

(limited to 'CHANGES')

diff --git a/CHANGES b/CHANGES
index 92fd6e11d0..032c224d98 100644
--- a/CHANGES
+++ b/CHANGES
@@ -43,6 +43,9 @@ Library
 
 - Use "Coq standard" names for the properties of eq and identity
   (e.g. refl_equal is now eq_refl). Support for compatibility is provided.
+- The function Compare_dec.nat_compare is now defined directly,
+  instead of relying on lt_eq_lt_dec. The earlier version is still
+  available under the name nat_compare_alt.
 
 Changes from V8.1 to V8.2
 =========================
-- 
cgit v1.2.3