Work

Polytypic pattern matching

Year: 1995

Type: conference-paper

Abstract: The pattern matching problem can be informally specified as follows: given a pattern and a text, find all occurrences of the pattern in the text. The pattern and the text may both be lists, or they may both be trees, or they may both be multi-dimensional arrays, etc. This paper describes a general pattern-matching algorithm for all datatypes definable as an initial object in a category of F-algebras, where F is a regular functor. This class of datatypes includes mutual recursive datatypes and lots of different kinds of trees. The algorithm is a generalisation of the Knuth, Morris, Pratt like pattern-matching algorithm on trees first described by Hoffmann and O'Donnell.

Source: International Conference on Functional Programming Languages and Computer Architecture (FPCA)

DOI: 10.1145/224164.224212

Author: Johan Jeuring

Institution: Chalmers University of Technology

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2051078013

FWCI: 3.61

Cites: 18

Cited by: 33

Related to: 10