On Thursday, October 6, 2011, Sam Tobin-Hochstadt <<a href="mailto:samth@ccs.neu.edu">samth@ccs.neu.edu</a>> wrote: > In Le Fessant and Maranget, ICFP 2001, they have measurements that > show a 30% speedup of whole (toy) programs, with a similar but smaller > suite of optimizations. Does match reproduce that speedup? > Given the extensibility of `match', the performance difference can be > made arbitrarily large. For example, Eli's example doesn't call the > `one??' function, which could take arbitrarily long (imagine a > database query). Match's reordering of the predicates can also slow it down arbitrarily with reasoning like that (imaging a predicate that is very fast at saying "no" on one element if a list and very slow to say "no" to a different element and that predicate is used twice in the same list pattern). I don't see how that helps us understand the value of reordering the patterns. Robby