#8914: Remove unnecessary constraints from MonadComprehensions and ParallelListComp -------------------------------------+------------------------------------- Reporter: Iceland_jack | Owner: Type: feature request | Status: new Priority: normal | Milestone: Component: Compiler (Type | Version: checker) | Keywords: Resolution: | Architecture: Unknown/Multiple Operating System: Unknown/Multiple | Difficulty: Difficult (2-5 Type of failure: None/Unknown | days) Test Case: | Blocked By: Blocking: | Related Tickets: -------------------------------------+------------------------------------- Comment (by simonpj): As you point out, it's quite similar to the !ApplicativeDo idea. But the latter has something approaching a specification, that says what type any given program has. Would you (or someone) like to come up with a specification for your proposed feature? Simon -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/8914#comment:1 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler