When Do Match-compilation Heuristics Matter?

Kevin Scott & Norman Ramsey
Modern, statically typed, functional languages define functions by pattern matching. Although pattern matching is defined in terms of sequential checking of a value against one pattern after another, real implementations translate patterns into automata that can test a value against many patterns at once. Decision trees are popular automata. The cost of using a decision tree is related to its size and shape. The only method guaranteed to produce decision trees of minimum cost requires...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.