#9131: Experiment with a dedicated solver for Coercible -------------------------------------+------------------------------------- Reporter: nomeata | Owner: Type: task | Status: closed Priority: low | Milestone: Component: Compiler | Version: 7.8.2 Resolution: fixed | Keywords: Operating System: Unknown/Multiple | Architecture: Type of failure: None/Unknown | Unknown/Multiple Blocked By: | Test Case: Related Tickets: | Blocking: | Differential Revisions: -------------------------------------+------------------------------------- Changes (by goldfire): * status: new => closed * resolution: => fixed Comment: Agreed. This is essentially done. The only part around here that's missing is some theoretical analysis of the new solver. It would be nice, for example, to have a proof that the solver is sound (only produces well-typed coercions) and to figure out what completeness property it has (it's certainly not totally complete). But there's little sense in having a ticket against GHC for that task. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/9131#comment:8 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler