Regular Expression Patterns
Paper in proceeding, 2004

We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as found in Haskell. It has proven useful for string manipulation and for processing structured data such as XML. Regular expression patterns can be used with arbitrary lists, and work seamlessly together with ordinary pattern matching in Haskell. Our extension is lightweight, it is little more than syntactic sugar. We present a semantics and a type system, and show how to implement it as a preprocessor to Haskell.

regular expressions


pattern matching


Niklas Broberg

Chalmers, Department of Computing Science, Functional Programming

Andreas Farre

Chalmers, Department of Computing Science

Josef Svenningsson

Chalmers, Department of Computing Science, Functional Programming

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming

67 - 78
1-58113-905-5 (ISBN)

Subject Categories

Computer Science



More information