Open
Description
src/LLVM/General/Internal/PrettyPrint.hs:166:19: error:
• The constructor ‘DataD’ should have 6 arguments, but has been given 5
• In the pattern: DataD _ _ tvb cons _
In the pattern: TyConI (DataD _ _ tvb cons _)
In a case alternative: TyConI (DataD _ _ tvb cons _) -> (tvb, cons)
src/LLVM/General/Internal/PrettyPrint.hs:171:3: error:
• Ambiguous type variable ‘m0’ arising from a use of ‘sequence’
prevents the constraint ‘(Monad m0)’ from being solved.
Probable fix: use a type annotation to specify what ‘m0’ should be.
These potential instances exist:
instance Monad m => Monad (WrappedMonad m)
-- Defined in ‘Control.Applicative’
instance Monad (Either e) -- Defined in ‘Data.Either’
instance Monad Dual -- Defined in ‘Data.Monoid’
...plus 10 others
...plus 27 instances involving out-of-scope types
(use -fprint-potential-instances to see them all)
• In the first argument of ‘(.)’, namely ‘sequence’
In the expression: sequence . return
In a stmt of a 'do' block:
sequence . return
$ instanceD
(cxt [appT (conT (mkName "PrettyShow")) cv | cv <- cvs])
[t| PrettyShow $(foldl appT (conT n) cvs) |]
pending(rn) [<splice, foldl appT (conT n) cvs>]
[funD
(mkName "prettyShow")
[clause
[...]
(normalB $ caseE (dyn "a") $ flip map cons $ \ con -> ...)
[]]]
src/LLVM/General/Internal/PrettyPrint.hs:171:14: error:
• Ambiguous type variable ‘t0’ arising from a use of ‘return’
prevents the constraint ‘(Monad t0)’ from being solved.
Probable fix: use a type annotation to specify what ‘t0’ should be.
These potential instances exist:
instance Monad m => Monad (WrappedMonad m)
-- Defined in ‘Control.Applicative’
instance Monad (Either e) -- Defined in ‘Data.Either’
instance Monad Dual -- Defined in ‘Data.Monoid’
...plus 10 others
...plus 27 instances involving out-of-scope types
(use -fprint-potential-instances to see them all)
• In the second argument of ‘(.)’, namely ‘return’
In the expression: sequence . return
In a stmt of a 'do' block:
sequence . return
$ instanceD
(cxt [appT (conT (mkName "PrettyShow")) cv | cv <- cvs])
[t| PrettyShow $(foldl appT (conT n) cvs) |]
pending(rn) [<splice, foldl appT (conT n) cvs>]
[funD
(mkName "prettyShow")
[clause
[...]
(normalB $ caseE (dyn "a") $ flip map cons $ \ con -> ...)
[]]]
src/LLVM/General/Internal/PrettyPrint.hs:192:18: error:
• The constructor ‘DataConI’ should have 3 arguments, but has been given 4
• In the pattern: DataConI _ _ _ (Fixity prec _)
In a stmt of a 'do' block:
DataConI _ _ _ (Fixity prec _) <- reify conName
In the expression:
do { DataConI _ _ _ (Fixity prec _) <- reify conName;
let ns = ...;
[p0, p1] <- mapM (const $ newName "f") ns;
let ss = ...;
.... }
At least two of these problems are due to changes in template-haskell. The latest Hackage release (3.5.10.0) claims to support base < 5, but the correct upper bound is base < 4.9. A new version should be released that does support base == 4.9.
Metadata
Metadata
Assignees
Labels
No labels