Transducers, Part C: Regular Functions in Terms of Combinators

lax-709149·formalized by Mikołaj Bojańczyk · Aristotle (Harmonic)·registered·created ·GitHub @baffefb·Lean v4.33.0 epoch · mathlib db584cd6d46c

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

    Section 5 of Part C of the book Transducers (M. Bojańczyk) as concepts and a proof: the combinator description of the regular functions. The Lean development is Aristotle's formalisation of the book, re-presented in the archive's form; it requires the submissions for Parts B and C §1–3.

    The definition-concepts are the types built from the unit type by product, co-product and list, with the string representation of their elements over an eight-letter alphabet (C.5.1), regularity of a type-to-type function under string representation (C.5.2), and the regular terms with their semantics (C.5.3). The theorem-concept is the implication of Theorem C.5.4 that every function defined by a regular term is regular under string representation, proved by induction on the term with a bracket-counter parser of the representations. The converse implication, expressive completeness of the terms, is not formalised and no statement here asserts it; the auxiliary lemmas and claims of the section are its steps and do not appear.

    Concepts

    Concept map
    10 concepts
    100%
    Proven claimDefinitionThis submissionOther submissionA → B: B builds on A

    Proofs

    Proof networkview on GitHub

    100%
    assumptions conclusionProven claimClaim from this submissionProof — open large view for details
    Proof list

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

    Related submissions

    Submission map

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

    Cite this

    This is only the formalizers. The authors of the formalized results may be different (see References).

    @misc{lax-709149,
      author = {Mikołaj Bojańczyk and Aristotle (Harmonic)},
      title = {Transducers, Part C: Regular Functions in Terms of Combinators},
      year = {2026},
      howpublished = {Lax Archive, lax-709149},
      url = {https://laxarchive.org/lax-709149/},
    }

    References

    1. Mikołaj Bojańczyk, Laure Daviaud and Shankara Narayanan Krishna. Regular and First-Order List Functions. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018) 125–134, 2018. doi:10.1145/3209108.3209163
    2. Mikołaj Bojańczyk. Transducers. 2026. Book in preparation; sources at https://github.com/bojanczyk/transducer-book.

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…