(***********************************************************************)
(*
- Time-stamp: <Last modified on 2013-01-30 19:07:23 CET by Kim Nguyen>
+ Time-stamp: <Last modified on 2013-03-04 23:03:05 CET by Kim Nguyen>
*)
(** Implementation of sets of Qualified Names that can be finite
or cofinite *)
include FiniteCofinite.S with type elt = QName.t
-include Sigs.AUX.Printable with type t := t
+include Common_sig.Printable with type t := t
-module Weak :
- sig
- include FiniteCofinite.S with type elt = QName.t
- include Sigs.AUX.Printable with type t := t
- end
+module Weak :
+sig
+ include FiniteCofinite.S with type elt = QName.t
+ include Common_sig.Printable with type t := t
+end