Regular Expression Types for Strings in a Text Processing Language (Extended Abstract)
Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa · 2003
Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa ftabee,sumii,[email protected] Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo May 1, 2002 Abstract We present , a minimal functional calculus with regular expression types for strings, in order to establish a theoretical foundation for 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.