Draft — mutable and not usable as a dependency; its citation marks the draft state.

Transducers, Part D: Polyregular Functions

lax-194892·formalized by Mikołaj Bojańczyk·Aristotle (Harmonic)·created 2026-09-07·GitHub @4bdfaae·Lean v4.30.0 epoch · mathlib c5ea00351c28

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this submission may be incorrect.

No flags have been submitted.

    Community review

    Flag this submission

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    Abstract

    Part D of the book Transducers (M. Bojańczyk) as concepts and proofs: the polyregular functions, the top of the transducer ladder, with their two machine models. The Lean development is Aristotle's formalisation of the book, re-presented in the archive's form; it requires the submissions for Parts A and C §1–3 (concepts) and for Part C §4 (proofs).

    The definition-concepts are marked squaring, the polyregular functions as compositions of regular functions and marked squaring (D.0.1), for-transducers with their prenex form (D.1.2), pebble transducers, the string representation of pairs of pebble configurations with balanced runs, and the children of a configuration with the string representation of child configuration graphs.

    The theorem-concepts are continuity of polyregular functions (D.0.2), the equivalence of for-transducers with polyregular functions (D.1.1, as two implications and their conjunction), the prenex normal form (D.1.3), closure of for-transducers under composition (D.1.4), continuity of pebble transducers (D.2.1), the regularity of reachability and of balanced reachability between configurations (D.2.2, D.2.3, stated as regular languages of encodings rather than as mso formulas), the equivalence of pebble transducers with for-transducers (D.2.4, split), and the three results on the children of a configuration (D.2.5–D.2.7). All are proved. The exercises are not part of this submission.

    In the paper

    Concepts

    Concept map

    Proven claimDefinitionThis submissionOther submissionA → B: B builds on A

    Proofs

    Proof networkview on GitHub

    assumptions conclusionProven claimThis submissionProof — click to open

    Lean sources for these proofs: proofs/ on GitHub

    Proof code is not displayed; the archive records each proof's checked relationship between claims.

    Related submissions

    Submission map

    This submissionOther submissionA → B: B's concepts build on AA → B: only B's proofs build on A

    Cite this

    @misc{lax-194892,
      author = {Mikołaj Bojańczyk and Aristotle (Harmonic)},
      title = {Transducers, Part D: Polyregular Functions},
      year = {2026},
      howpublished = {Lax Archive, lax-194892},
      url = {https://laxarchive.org/lax-194892/},
      note = {draft},
    }

    References

    1. Mikołaj Bojańczyk. Polyregular Functions. 2018. arXiv:1810.08760
    2. Tova Milo, Dan Suciu and Victor Vianu. Typechecking for XML Transformers. Journal of Computer and System Sciences 66(1):66–97, 2003. doi:10.1016/S0022-0000(02)00030-2
    3. Joost Engelfriet and Sebastian Maneth. Two-Way Finite State Transducers with Nested Pebbles. Mathematical Foundations of Computer Science (MFCS 2002), Lecture Notes in Computer Science 2420:234–244, 2002. doi:10.1007/3-540-45687-2_19
    4. Mikołaj Bojańczyk. Transducers. 2026. Book in preparation; sources at r̆lhttps://github.com/bojanczyk/transducer-book.

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…