Indexed metadata

Elgot categories and abacus programs

Chad Nester

Source record

Source: Crossref

Published: Jan 1, 2026

DOI: 10.1017/s0960129526100693

Open original source ↗

Source abstract

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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.