Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa. Regular Expression Types for Strings in a Text Processing Language. Electronic Notes in Theoretical Computer Science, TIP'02, International Workshop in Types in Programming, 75:95-113, 2003.
Download paper:
Doi page
Download paper:
Adobe portable document (pdf) 
Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
We present [lambda]re, a minimal functional calculus with regular expression types for strings, in order to establish a theoretical foundation of using regular expressions as types of strings in text processing languages. The major technical novelties in this paper (with respect to other work such as XDuce) are (1) the use of regular expression effects to statically analyze the shape of the output of an even diverging program and (2) the treatment of as-patterns in non-tail positions. We expect that our approach will be of help for bringing the merits of static typing into scripting languages such as Perl, Python, and Ruby without sacrificing too much of their expressiveness and flexibility
[ Regexp ]
Naoshi Tabuchi
E. Sumii
Akinori Yonezawa
@article{tsy2003,
Author = {Tabuchi, Naoshi and Sumii, Eijiro and Yonezawa, Akinori},
Title = {Regular Expression Types for Strings in a Text Processing Language},
Journal = {Electronic Notes in Theoretical Computer Science},
Volume = {75},
Pages = {95--113},
Year = {2003}
}
Get EndNote Reference (.ref)