7 search results - page 2 / 2 » A Hierarchy Theorem for Regular Languages over Free Bisemigr... |
FPCA
1989
13 years 10 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
CAI
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...