#9429: Alternative to type family Any -------------------------------------+------------------------------------- Reporter: mboes | Owner: Type: feature | Status: new request | Milestone: Priority: normal | Version: 7.9 Component: Compiler | Keywords: Resolution: | Architecture: Unknown/Multiple Operating System: | Difficulty: Unknown Unknown/Multiple | Blocked By: Type of failure: | Related Tickets: 9097, 9380 None/Unknown | Test Case: | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- Comment (by mboes): Making pattern-matching `Any`-aware makes sense to me. Again, I'm not qualified to understand what the best way forward is here. But to answer carter's question, ultimately for the purposes of `rank1dynamic` (and by extension Cloud Haskell), what we need is way of reifying more polymorphic types than we currently can. Introducing some kind of `PolyTypeable` mechanism could certainly bypass the question at hand. Really not sure how such an extension would work though. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/9429#comment:9 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler