test case from PR5918

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

3 files changed, 117 insertions, 0 deletions

diff --git a/testsuite/tests/typing-short-paths/pr5918.ml b/testsuite/tests/typing-short-paths/pr5918.ml
new file mode 100644
index 0000000000..604f66d84f
--- /dev/null
+++ b/testsuite/tests/typing-short-paths/pr5918.ml
@@ -0,0 +1,7 @@
+module rec A : sig
+ type t
+end = struct
+ type t = { a : unit; b : unit }
+ let _ = { a = () }
+end
+;;
diff --git a/testsuite/tests/typing-short-paths/pr5918.ml.reference b/testsuite/tests/typing-short-paths/pr5918.ml.reference
new file mode 100644
index 0000000000..3364e16d29
--- /dev/null
+++ b/testsuite/tests/typing-short-paths/pr5918.ml.reference
@@ -0,0 +1,6 @@
+
+#             Characters 82-92:
+   let _ = { a = () }
+           ^^^^^^^^^^
+Error: Some record fields are undefined: b
+# 
diff --git a/testsuite/tests/typing-short-paths/short-paths.ml.reference b/testsuite/tests/typing-short-paths/short-paths.ml.reference
index e69de29bb2..f85186f6e4 100644
--- a/testsuite/tests/typing-short-paths/short-paths.ml.reference
+++ b/testsuite/tests/typing-short-paths/short-paths.ml.reference
@@ -0,0 +1,104 @@
+
+# # Characters -1--1:
+  Clflags.real_paths := false;;
+  
+Error: Reference to undefined global `Clflags'
+#                                 module Core :
+  sig
+    module Int :
+      sig
+        module T :
+          sig
+            type t = int
+            val compare : 'a -> 'a -> t
+            val ( + ) : t -> t -> t
+          end
+        type t = int
+        val compare : 'a -> 'a -> t
+        val ( + ) : t -> t -> t
+        module Map :
+          sig
+            type key = t
+            type 'a t = 'a Map.Make(T).t
+            val empty : 'a t
+            val is_empty : 'a t -> bool
+            val mem : key -> 'a t -> bool
+            val add : key -> 'a -> 'a t -> 'a t
+            val singleton : key -> 'a -> 'a t
+            val remove : key -> 'a t -> 'a t
+            val merge :
+              (key -> 'a option -> 'b option -> 'c option) ->
+              'a t -> 'b t -> 'c t
+            val compare : ('a -> 'a -> key) -> 'a t -> 'a t -> key
+            val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
+            val iter : (key -> 'a -> unit) -> 'a t -> unit
+            val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
+            val for_all : (key -> 'a -> bool) -> 'a t -> bool
+            val exists : (key -> 'a -> bool) -> 'a t -> bool
+            val filter : (key -> 'a -> bool) -> 'a t -> 'a t
+            val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
+            val cardinal : 'a t -> key
+            val bindings : 'a t -> (key * 'a) list
+            val min_binding : 'a t -> key * 'a
+            val max_binding : 'a t -> key * 'a
+            val choose : 'a t -> key * 'a
+            val split : key -> 'a t -> 'a t * 'a option * 'a t
+            val find : key -> 'a t -> 'a
+            val map : ('a -> 'b) -> 'a t -> 'b t
+            val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
+          end
+      end
+    module Std :
+      sig
+        module Int :
+          sig
+            module T :
+              sig
+                type t = int
+                val compare : 'a -> 'a -> t
+                val ( + ) : t -> t -> t
+              end
+            type t = int
+            val compare : 'a -> 'a -> t
+            val ( + ) : t -> t -> t
+            module Map :
+              sig
+                type key = t
+                type 'a t = 'a Map.Make(T).t
+                val empty : 'a t
+                val is_empty : 'a t -> bool
+                val mem : key -> 'a t -> bool
+                val add : key -> 'a -> 'a t -> 'a t
+                val singleton : key -> 'a -> 'a t
+                val remove : key -> 'a t -> 'a t
+                val merge :
+                  (key -> 'a option -> 'b option -> 'c option) ->
+                  'a t -> 'b t -> 'c t
+                val compare : ('a -> 'a -> key) -> 'a t -> 'a t -> key
+                val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
+                val iter : (key -> 'a -> unit) -> 'a t -> unit
+                val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
+                val for_all : (key -> 'a -> bool) -> 'a t -> bool
+                val exists : (key -> 'a -> bool) -> 'a t -> bool
+                val filter : (key -> 'a -> bool) -> 'a t -> 'a t
+                val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
+                val cardinal : 'a t -> key
+                val bindings : 'a t -> (key * 'a) list
+                val min_binding : 'a t -> key * 'a
+                val max_binding : 'a t -> key * 'a
+                val choose : 'a t -> key * 'a
+                val split : key -> 'a t -> 'a t * 'a option * 'a t
+                val find : key -> 'a t -> 'a
+                val map : ('a -> 'b) -> 'a t -> 'b t
+                val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
+              end
+          end
+      end
+  end
+#     #   val x : 'a Int.Map.t = <abstr>
+# Characters 8-9:
+  let y = x + x ;;
+          ^
+Error: This expression has type 'a Int.Map.t
+       but an expression was expected of type int
+#