aboutsummaryrefslogtreecommitdiffhomepage
path: root/theories/Sorting
diff options
context:
space:
mode:
authorGravatar msozeau <msozeau@85f007b7-540e-0410-9357-904b9bb8a0f7>2010-01-30 15:26:23 +0000
committerGravatar msozeau <msozeau@85f007b7-540e-0410-9357-904b9bb8a0f7>2010-01-30 15:26:23 +0000
commit3ef3e0d145c2765c17e0f10b9c0d896c09365662 (patch)
treeec4a22c0a294cec0ccf711687b6910045e139707 /theories/Sorting
parent5c97a67f3227f718a2247c9476029548c4ee8e28 (diff)
Update CHANGES, add documentation for new commands/tactics and do a bit
of cleanup in tactics/ git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12705 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Sorting')
-rw-r--r--theories/Sorting/Permutation.v9
1 files changed, 4 insertions, 5 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v
index da30d096c..c3cd4f4a8 100644
--- a/theories/Sorting/Permutation.v
+++ b/theories/Sorting/Permutation.v
@@ -75,11 +75,10 @@ Hint Resolve Permutation_refl Permutation_sym Permutation_trans.
(* This provides reflexivity, symmetry and transitivity and rewriting
on morphims to come *)
-Add Parametric Relation A : (list A) (@Permutation A)
- reflexivity proved by (@Permutation_refl A)
- symmetry proved by (@Permutation_sym A)
- transitivity proved by (@Permutation_trans A)
-as Permutation_Equivalence.
+Instance Permutation_Equivalence A : Equivalence (@Permutation A) | 10 := {
+ Equivalence_Reflexive := @Permutation_refl A ;
+ Equivalence_Symmetric := @Permutation_sym A ;
+ Equivalence_Transitive := @Permutation_trans A }.
Add Parametric Morphism A (a:A) : (cons a)
with signature @Permutation A ==> @Permutation A