From 3aecd501990a1a380ae5258cad3c2edd0a11bcd0 Mon Sep 17 00:00:00 2001 From: letouzey Date: Mon, 2 Nov 2009 13:36:49 +0000 Subject: 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 --- theories/Sorting/Permutation.v | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'theories/Sorting') 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 -- cgit v1.2.3