X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2Ftests%2Ftypecheck%2Fshould_fail%2FDigraph.stderr;fp=ghc%2Fcompiler%2Ftests%2Ftypecheck%2Fshould_fail%2FDigraph.stderr;h=03ae28a44cb6a317037800af3f052f456205aa87;hb=349880a7ab565d31c0a0f91eb3776be63d9bfa84;hp=a61101ca92f5c1c019e8a5d805ead63250a91787;hpb=1eefbbdd8b1a6ae1ed9098001573232f981fa0ea;p=ghc-hetmet.git

diff --git a/ghc/compiler/tests/typecheck/should_fail/Digraph.stderr b/ghc/compiler/tests/typecheck/should_fail/Digraph.stderr
index a61101c..03ae28a 100644
--- a/ghc/compiler/tests/typecheck/should_fail/Digraph.stderr
+++ b/ghc/compiler/tests/typecheck/should_fail/Digraph.stderr
@@ -1,8 +1,58 @@
  
-"Digraph.hs", line 19: Type signature is too polymorphic:
-    Signature: [Edge v]
-    Monomorphic type variables: v
-    In a type signature: [Edge v]
-Fail: Compilation errors found
+Digraph.hs:19: A type signature is more polymorphic than the inferred type
+		   Some type variables in the inferred type can't be forall'd, namely:
+		   `v{-a13W-}'
+		   Possible cause: the RHS mentions something subject to the monomorphism restriction
+    When checking signature for `reversed_edges'
+    In an equation for function `stronglyConnComp':
+	`stronglyConnComp es vs   =   PrelTup.snd
+					  (span_tree
+					       (new_range
+						    reversed_edges)
+					       (PrelBase.[], (PrelBase.[]))
+					       (PrelTup.snd
+						    (dfs (new_range
+							      es)
+							 (PrelBase.[], (PrelBase.[]))
+							 vs)))
+				  where
+				      span_tree
+					  r (vs, ns) PrelBase.[]
+						  =   (vs, (ns))
+				      span_tree
+					  r (vs, ns) (x PrelBase.: xs)
+						  | [x PrelList.elem vs] =
+						      span_tree
+							  r (vs, (ns)) xs
+						  | [PrelBase.otherwise] =
+						      span_tree
+							  r
+							  (vs', ((x PrelBase.: ns') PrelBase.: ns))
+							  xs
+						  where
+						      (vs', ns')
+							  =   dfs r
+								  (x PrelBase.: vs, (PrelBase.[]))
+								  (r   x)
+				      new_range
+					  PrelBase.[] w
+						  =   PrelBase.[]
+				      new_range
+					  ((x, y) PrelBase.: xys) w
+						  =   if x PrelBase.== w then
+							  (y
+							   PrelBase.: (new_range
+									   xys w))
+						      else
+							  (new_range
+							       xys w)
+				      swap
+					  (x, y)  =   (y, (x))
+				      reversed_edges ::
+					  _forall_ [v] {PrelBase.Eq v} => [Edge v]
+				      reversed_edges
+					  =   PrelBase.map
+						  swap es'
 
-ghc: execution of the Haskell compiler had trouble
+
+Compilation had errors