When Do Match-Compilation Heuristics Matter? (2000)
Cached
Download Links
by
Kevin Scott
,
Norman Ramsey
| Citations: | 7 - 1 self |
BibTeX
@TECHREPORT{Scott00whendo,
author = {Kevin Scott and Norman Ramsey},
title = {When Do Match-Compilation Heuristics Matter?},
institution = {},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
