We present DReX, a declarative language that can express all regular string-to-string transformations, and yet can be evaluated efficiently. The class of regular string transformations has a robust theoretical foundation including multiple characterizations, closure properties, and decidable analysis questions, and admits a number of string operations such as insertion, deletion, substring swap...