DeepAI AI Chat
Log In Sign Up

Folding interpretations

by   Mikołaj Bojańczyk, et al.

We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike previous systems, the present system includes an iteration mechanism, namely fold. Although unrestricted fold can define all primitive recursive functions, we identify a type system (inspired by linear logic) that restricts fold so that it defines exactly the polyregular functions. We also present related systems, for quantifier-free functions as well as for linear regular functions on both strings and trees.


String-to-String Interpretations with Polynomial-Size Output

String-to-string MSO interpretations are like Courcelle's MSO transducti...

On the growth rate of polyregular functions

We consider polyregular functions, which are certain string-to-string fu...

Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs

Polyregular functions are the class of string-to-string functions defina...

Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics

We characterize regular string transductions as programs in a linear λ-c...

Typed lambda-calculi and superclasses of regular functions

We propose to use Church encodings in typed lambda-calculi as the basis ...

Rational functions via recursive schemes

We give a new characterization of the class of rational string functions...

FOLD-TR: A Scalable and Efficient Inductive Learning Algorithm for Learning To Rank

FOLD-R++ is a new inductive learning algorithm for binary classification...