Polytypic pattern matching
- 1 January 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 238-248
- https://doi.org/10.1145/224164.224212
Abstract
The (exact) pattern matching problem can be informallyspecified as follows: given a pattern and a text, find alloccurrences of the pattern in the text. The pattern andthe text may both be lists, or they may both be trees, orthey may both be multi-dimensional arrays, etc. This paperdescribes a general pattern-matching algorithm for alldatatypes definable as an initial object in a category ofF -algebras, where F is a regular functor. This class ofdatatypes includes mutual recursive...Keywords
This publication has 0 references indexed in Scilit: