Paper P140 pagesReviewed manuscript
CatDB: A Categorical Semantic Model for Executable Database Schemas
Which categorical structures have useful, checkable operational meaning for executable schemas?
Question and scope
A finite schema-presentation model separating mathematical laws, database constraints, compiled checks, and higher-level invariants.
Research artifacts
formal vocabulary, examples, comparison matrix, semantic IR requirements, and shared fixtures.
Evidence and evaluation
path and mapping examples evaluated by Rust and Haskell; selected path laws represented in Lean.
Claim boundary
category theory does not subsume every relational, graph, RDF, OWL, or multimodel feature.
Dependencies
This foundational paper has no paper dependency.