English

Elgot Categories and Abacus Programs

Category Theory 2025-03-28 v1 Logic in Computer Science

Abstract

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.

Keywords

Cite

@article{arxiv.2503.21434,
  title  = {Elgot Categories and Abacus Programs},
  author = {Chad Nester},
  journal= {arXiv preprint arXiv:2503.21434},
  year   = {2025}
}

Comments

In peer rewview, although not at MFPS, I'm just using their style files!

R2 v1 2026-06-28T22:36:36.421Z