Abstract
This paper presents a new algoxithm for compiling term pattern-matching for functional languages. Earlier algorithms may produce duplicated code, and redundant or sub-optimal discrimination tests for certain combinationw of patterns, in particular when a pattern column contains a mixture of constructors and variables. This algorithm, which was inspired by finite automata theory, addresses these problems and solves them to some extent. It does so by viewing patterns as regular expressions and optimizing the finite automaton that is built to recognize them. It also makes checking patterns for exhaustiveness and irredundancy cheap operations.
Cite
CITATION STYLE
Pettersson, M. (1992). A term pattern-match compiler inspired by finite automata theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 641 LNCS, pp. 258–270). Springer Verlag. https://doi.org/10.1007/3-540-55984-1_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
