Implicit automata in typed $\lambda$-calculi II: streaming transducers vs categorical semantics

Lê Thành Dũng Nguyên, Camille Noûs, Cécilia Pradic

We characterize regular string transductions as programs in a linear $\lambda$-calculus with additives. One direction of this equivalence is proved by encoding copyless streaming string…