#14201: Implement ideas from "Compiling Pattern Matching to Good Decision Trees" -------------------------------------+------------------------------------- Reporter: AndreasK | Owner: AndreasK Type: feature request | Status: new Priority: normal | Milestone: Component: Compiler | Version: 8.2.1 Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: | Unknown/Multiple Type of failure: None/Unknown | Test Case: Blocked By: | Blocking: Related Tickets: | Differential Rev(s): Wiki Page: | -------------------------------------+------------------------------------- Comment (by AndreasK): Indeed. My plan currently is to select columns in the pattern matrix such that we only choose from these strict in the first row. But my plan is to first formalize the interaction with imprecise exceptions. Then work out heuristics compatible with laziness. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/14201#comment:3 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler