Symmetric List Objects
Cons-lists are fundamental to functional programming, and are well-understood as initial algebras, and as a concrete construction of free monoids. In category theory, such list objects can be axiomatised internal to any monoidal category, with nil and cons maps, and a recursion mechanism. When strengthened to support parametrised recursion, they can be shown to give the free monoid construction. We study a small variant on parametrised list objects called parametrised symmetric list objects, in a symmetric monoidal category, where the two frontmost elements are allowed to be permuted. We show that this gives a construction of free commutative monoids, and develop some related theory.
- quotes — Symmetric List Objects (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)
- quotes — summary: Cons-lists are fundamental to functional programming, and are well-understood as initial algebras, and as a concrete construction of free monoids. In category theory, such list objects can be axiomatised internal to any monoidal category, with nil and cons maps, and a recursion mechanism. When strengthened to support parametrised recursion, they can be shown to give the free monoid construction. We study a small variant on parametrised list objects called parametrised symmetric list objects, in a symmetric monoidal category, where the two frontmost elements are allowed to be permuted. We show that this gives a construction of free commutative monoids, and develop some related theory. (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)
- quotes — url: https://arxiv.org/abs/2610.37944 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)
- quotes — source-subject: arxiv:2610.37944 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)
- quotes — source-edition: sha256:427c9b3e03d9fc2f82289ba96703d51b313a1d8668a627dfffda2337a32631a4 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)
- quotes — source-metadata: {"subject":"arxiv:2610.37944","id":"2610.37944","url":"https://arxiv.org/abs/2610.37944","datestamp":"2026-10-30","status":"present","title":"Symmetric List Objects","abstract":"Cons-lists are fundamental to functional programming, and are well-understood as initial algebras, and as a concrete construction of free monoids. In category theory, such list objects can be axiomatised internal to any monoidal category, with nil and cons maps, and a recursion mechanism. When strengthened to support parametrised recursion, they can be shown to give the free monoid construction. We study a small variant on parametrised list objects called parametrised symmetric list objects, in a symmetric monoidal category, where the two frontmost elements are allowed to be permuted. We show that this gives a construction of free commutative monoids, and develop some related theory.","authors":["Fiona Blackett","Vikraman Choudhury","Rin Liu"],"categories":["math.CT","cs.LO"],"created":"2026-10-27","updated":"2026-10-30","articleLicense":"http://creativecommons.org/licenses/by-nc-nd/4.0/","version":null,"editionDigest":"sha256:427c9b3e03d9fc2f82289ba96703d51b313a1d8668a627dfffda2337a32631a4","sourceResponseAt":"2026-10-30T11:34:50Z","sourceDigest":"sha256:4542ea3b17c1f33c3620bba7f90b80242598dd20d88d57ff7f58a3e03c5ad483"} (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)
- quotes — editorial-standing: source metadata; editorial acceptance pending (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2610.37944; status: unverified)