Abstract
We introduce snoc-trees which generalise snoc-lists, i.e., backwards lists where new elements are added at the back rather than at the front of the list. We uncover the categorical and computational structure of snoc-trees using both functorial and container-theoretic approaches, and show the power of their associated fold operator. We relate snoc-trees to the usual trees arising from initial algebra semantics, and demonstrate the use of snoc-trees via an example arising from a type theoretic variant of compositional sampling from a probability distribution.
| Original language | English |
|---|---|
| Number of pages | 14 |
| Publication status | Published - 6 Jul 2026 |
| Event | 9th International Conference on Applied Category Theory - Tallinn, Tallinn, Estonia Duration: 6 Jul 2026 → 10 Jul 2026 Conference number: 9 https://actconf2026.github.io/ |
Conference
| Conference | 9th International Conference on Applied Category Theory |
|---|---|
| Abbreviated title | ACT |
| Country/Territory | Estonia |
| City | Tallinn |
| Period | 6/07/26 → 10/07/26 |
| Internet address |
Keywords
- snoc tees
- snoc lists
- semantics
Fingerprint
Dive into the research topics of 'Snoc trees: growing trees from the leaves'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver