Regular expression types for strings in a text processing language

Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa

Research output: Contribution to journalConference articlepeer-review

8 Citations (Scopus)

Abstract

We present λ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.

Original languageEnglish
Pages (from-to)95-113
Number of pages19
JournalElectronic Notes in Theoretical Computer Science
Volume75
DOIs
Publication statusPublished - 2003 Feb
EventTIP'02, International Worshop in Types in Programming - Dagstuhl, Germany
Duration: 2002 Jul 82002 Jul 8

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Regular expression types for strings in a text processing language'. Together they form a unique fingerprint.

Cite this