Copenhagen Programming Language
"Typed and Unambiguous Pattern Matching on Strings using Regular Expressions"
IT University of Copenhagen
Tuesday 11 May 2010 at 15:15-16:00
DIKU, Universitetsparken 1, Room N030
We show how to achieve typed and unambiguous declarative
pattern matching on strings using regular expressions
extended with a simple recording operator.
We give a characterization of ambiguity of regular expressions
that leads to a sound and complete static analysis. The
analysis is capable of pinpointing all ambiguities in terms of
the structure of the regular expression and report shortest
ambiguous strings. We also show how pattern matching can
be integrated into statically typed programming languages
for deconstructing strings and reproducing typed and structured
We validate our approach by giving a full implementation
of the approach presented in this paper. The resulting tool,
reg-exp-rec, adds typed and unambiguous pattern matching
to Java in a stand-alone and non-intrusive manner. We
evaluate the approach using several realistic examples.
This is joint work with Jakob G. Thomsen (Aarhus Uni).
Fritz Henglein Administrative host:Renée Korver Michan.
All are welcome.
The Copenhagen Programming
Language Seminar (COPLAS) is a collaboration between DIKU,
COPLAS is sponsored by the FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to
email@example.com with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see