aboutsummaryrefslogtreecommitdiffhomepage
path: root/theories/Sorting/Permutation.v
diff options
context:
space:
mode:
authorGravatar letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7>2008-03-19 18:46:59 +0000
committerGravatar letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7>2008-03-19 18:46:59 +0000
commit0157aadd967fcba870fb9bf74ea2af7671105efc (patch)
tree84c071f7ec4b600831c36eefc44ce226f0dd4f22 /theories/Sorting/Permutation.v
parent1f31ca099259fbea08a7fef56e1989283aec040a (diff)
Coq.Relations.Relations can move back to its short name
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10698 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Sorting/Permutation.v')
-rw-r--r--theories/Sorting/Permutation.v2
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v
index ee8c192a6..e9bbf88e3 100644
--- a/theories/Sorting/Permutation.v
+++ b/theories/Sorting/Permutation.v
@@ -8,7 +8,7 @@
(*i $Id$ i*)
-Require Import Coq.Relations.Relations List Multiset Arith.
+Require Import Relations List Multiset Arith.
(** This file define a notion of permutation for lists, based on multisets:
there exists a permutation between two lists iff every elements have