#5344: CSE should look through coercions
---------------------------------+------------------------------------------
Reporter: reinerp | Owner: simonpj
Type: feature request | Status: new
Priority: normal | Milestone: _|_
Component: Compiler | Version: 7.0.3
Keywords: cse | Testcase:
Blockedby: | Difficulty:
Os: Unknown/Multiple | Blocking:
Architecture: Unknown/Multiple | Failure: Runtime performance bug
---------------------------------+------------------------------------------
Changes (by simonpj):
* milestone: 7.6.1 => _|_
Comment:
You want to answer the question "Are these two expressions `e1`, `e2`
equal modulo a coercion, so that `e1` = `e2 |> co`?" I'm sure it's
possible to do that, but I don't see how to do it efficiently.
Nice idea, though!
I'll milestone for bottom unless someone comes up with a plausible
implementation.
Simon
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/5344#comment:2>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
