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

by   Lê Thành Dũng Nguyên, et al.

We characterize regular string transductions as programs in a linear λ-calculus with additives. One direction of this equivalence is proved by encoding copyless streaming string transducers (SSTs), which compute regular functions, into our λ-calculus. For the converse, we consider a categorical framework for defining automata and transducers over words, which allows us to relate register updates in SSTs to the semantics of the linear λ-calculus in a suitable monoidal closed category. To illustrate the relevance of monoidal closure to automata theory, we also leverage this notion to give abstract generalizations of the arguments showing that copyless SSTs may be determinized and that the composition of two regular functions may be implemented by a copyless SST. Our main result is then generalized from strings to trees using a similar approach. In doing so, we exhibit a connection between a feature of streaming tree transducers and the multiplicative/additive distinction of linear logic. Keywords: MSO transductions, implicit complexity, Dialectica categories, Church encodings


page 1

page 2

page 3

page 4


Typed lambda-calculi and superclasses of regular functions

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

String Diagrams for Regular Logic (Extended Abstract)

Regular logic can be regarded as the internal language of regular catego...

Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables

Regular expressions are a classical concept in formal language theory. R...

Graphical Regular Logic

Regular logic can be regarded as the internal language of regular catego...

Folding interpretations

We study the polyregular string-to-string functions, which are certain f...

Semantic Proof of Confluence of the Categorical Reduction System for Linear Logic

We verify a confluence result for the rewriting calculus of the linear c...

Twinning automata and regular expressions for string static analysis

In this paper we formalize and prove the soundness of Tarsis, a new abst...

Please sign up or login with your details

Forgot password? Click here to reset