Lambda Calculus with Regular Types

In this paper we introduce λ R : A foundational calculus for sequence processing with regular expression types. Its term language is the lambda calculus extended with sequences of terms and its types are regular expressions over simple types. We provide a flexible notion of subtyping based on the se... View More