Elgot Categories and Abacus Programs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908286853316608 |
|---|---|
| author | Nester, Chad |
| author_facet | Nester, Chad |
| contents | We introduce Elgot categories, a sort of distributive monoidal category with additional structure in which the partial recursive functions are representable. Moreover, we construct an initial Elgot category, the morphisms of which coincide with a lightly modified version of Lambek's abacus programs. The partial functions that are strongly representable in this initial Elgot category are precisely the partial recursive ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_21434 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Elgot Categories and Abacus Programs Nester, Chad Category Theory Logic in Computer Science We introduce Elgot categories, a sort of distributive monoidal category with additional structure in which the partial recursive functions are representable. Moreover, we construct an initial Elgot category, the morphisms of which coincide with a lightly modified version of Lambek's abacus programs. The partial functions that are strongly representable in this initial Elgot category are precisely the partial recursive ones. |
| title | Elgot Categories and Abacus Programs |
| topic | Category Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2503.21434 |