diff options
| author |  letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2009-11-02 13:36:49 +0000 |
|---|---|---|
| committer | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2009-11-02 13:36:49 +0000 |
| commit | 3aecd501990a1a380ae5258cad3c2edd0a11bcd0 (patch) | |
| tree | 7ddc708cda10d5351d0a8ea7910be40507548ee7 /theories/Sorting | |
| parent | 0d651865b60bfa937e3857ede664938660b29abd (diff) | |
Sorting/Permutation: no need to require the whole Arith (and hence plugins like ring)
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12454 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Sorting')
| -rw-r--r-- | theories/Sorting/Permutation.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v index 9daf71b2b..27ba50908 100644 --- a/theories/Sorting/Permutation.v +++ b/theories/Sorting/Permutation.v @@ -8,7 +8,7 @@ (*i $Id$ i*) -Require Import Relations List Multiset Arith. +Require Import Relations List Multiset Plus. (** This file define a notion of permutation for lists, based on multisets: there exists a permutation between two lists iff every elements have |