Department of Computer Science, Tokyo Institute of Technology, 2-12-1-W8-69, Ookayama, Meguro, Tokyo 152-8552, Japan.

---

Abstract—We often give proper names to variables in programs based on their types, usages, and means, and the regularity and there are several kinds of conventions for variable-naming in programming languages. For example, we use variables i, j, k or i1, i2, i3 for thevariables of integer type. In this paper, we propose let-binding mechanism by which you can declare multiple variables simultaneously using regular expressions. We formalize this variable binding mechanism in the framework of the lambda calculus: we propose a lambda calculus with the regular expression let-bindings and a simple type system to the calculus in the style of Curry. We then study the calculus and the type system from the theoretical viewpoint.

Index Terms—Programming language design, functional programming language, regular expression, variable declaration.

[PDF]

Cite: Takuya Ohata, Shin-ya Nishizaki, "Let-Binding with Regular Expressions in Lambda Calculus," Journal of Software vol. 11, no. 2, pp. 220-229, 2016.