Introduction de "S with module ... = ..."

git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@306 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02

3 files changed, 3 insertions, 3 deletions

diff --git a/stdlib/map.mli b/stdlib/map.mli
index 99b2dd2db..eb624c8cd 100644
--- a/stdlib/map.mli
+++ b/stdlib/map.mli
@@ -66,6 +66,6 @@ module type S =
            not specified. *)
   end
 
-module Make(Ord: OrderedType): (S with key = Ord.t)
+module Make(Ord: OrderedType): (S with type key = Ord.t)
         (* Functor building an implementation of the map structure
            given a totally ordered type. *)
diff --git a/stdlib/set.ml b/stdlib/set.ml
index e7aa9d643..140b7ff47 100644
--- a/stdlib/set.ml
+++ b/stdlib/set.ml
@@ -40,7 +40,7 @@ module type S =
     val choose: t -> elt
   end
 
-module Make(Ord: OrderedType): (S with elt = Ord.t) =
+module Make(Ord: OrderedType) =
   struct
     type elt = Ord.t
     type t = Empty | Node of t * elt * t * int
diff --git a/stdlib/set.mli b/stdlib/set.mli
index 899226127..fbb62446d 100644
--- a/stdlib/set.mli
+++ b/stdlib/set.mli
@@ -84,6 +84,6 @@ module type S =
            but equal elements will be chosen for equal sets. *)
   end
 
-module Make(Ord: OrderedType): (S with elt = Ord.t)
+module Make(Ord: OrderedType): (S with type elt = Ord.t)
         (* Functor building an implementation of the set structure
            given a totally ordered type. *)