From 6b006ec56f9750293c5ac6c8f69233d37318f41d Mon Sep 17 00:00:00 2001 From: herbelin Date: Wed, 7 Feb 2007 14:42:26 +0000 Subject: Backtrack sur le passage de Set à Type pour l'ordre lexicographique pour garder Relation_Operators.Pow dans Set (puisque le polymorphisme d'univers pour les inductifs ne se propage pas aux définitions) MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9609 85f007b7-540e-0410-9357-904b9bb8a0f7 --- theories/Relations/Relation_Operators.v | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'theories/Relations') diff --git a/theories/Relations/Relation_Operators.v b/theories/Relations/Relation_Operators.v index c8ace84c3..8d76b4f4e 100644 --- a/theories/Relations/Relation_Operators.v +++ b/theories/Relations/Relation_Operators.v @@ -138,7 +138,7 @@ End Swap. Section Lexicographic_Exponentiation. - Variable A : Type. + Variable A : Set. Variable leA : A -> A -> Prop. Let Nil := nil (A:=A). Let List := list A. @@ -156,7 +156,7 @@ Section Lexicographic_Exponentiation. forall (x y:A) (l:List), leA x y -> Desc (l ++ y :: Nil) -> Desc ((l ++ y :: Nil) ++ x :: Nil). - Definition Pow : Type := sig Desc. + Definition Pow : Set := sig Desc. Definition lex_exp (a b:Pow) : Prop := Ltl (proj1_sig a) (proj1_sig b). -- cgit v1.2.3