2 citations · 4 across the 7 of their papers we have counts for
7 papers
Problems with fixpoints of polynomials of polynomials
Cécilia Pradic, Ian Price
Motivated by applications in computable analysis, we study fixpoints of certain endofunctors over categories of containers. More specifically, we focus on fibred endofunctors over…
Weihrauch problems as containers
Cécilia Pradic, Ian Price
We note that Weihrauch problems can be regarded as containers over the category of projective represented spaces and that Weihrauch reductions correspond exactly to container morph…
Implicit automata in λ-calculi III: affine planar string-to-string functions
Cécilia Pradic, Ian Price
We prove a characterization of first-order string-to-string transduction via -terms typed in non-commutative affine logic that compute with Church encoding, extending the analog…
Two-way automata and transducers with planar behaviours are aperiodic
Lê Thành Dũng Nguyên, Camille Noûs, Cécilia Pradic
We consider a notion of planarity for two-way finite automata and transducers, inspired by Temperley-Lieb monoids of planar diagrams. We show that this restriction captures star-fr…
Refutations of pebble minimization via output languages
Sandra Kiefer, Lê Thành Dũng Nguyên, Cécilia Pradic
Polyregular functions are the class of string-to-string functions definable by pebble transducers, an extension of finite-state automata with outputs and multiple two-way reading h…
Comparison-free polyregular functions
Lê Thành Dũng Tito Nguyên, Camille Noûs, Cécilia Pradic
This paper introduces a new automata-theoretic class of string-to-string functions with polynomial growth. Several equivalent definitions are provided: a machine model which is a r…
Implicit automata in typed -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 -calculus with additives. One direction of this equivalence is proved by encoding copyless streaming string…