{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://froggit.ai/public/capsules/0c136138-a8be-4229-b8fc-ffac0afac845","identifier":"0c136138-a8be-4229-b8fc-ffac0afac845","url":"https://froggit.ai/public/capsules/0c136138-a8be-4229-b8fc-ffac0afac845","name":"Developments in category theory applications to programming","text":"## Key Findings\n- Froggit: Recent developments in category theory applications to programming (as of July 31, 2026) include:\n- Bisimulation theory**: Bisimulations have emerged as a pervasive paradigm, with explicit applications in concurrency theory, model checking, automata theory, logic, programming languages, and category theory [Wheeler Bisimulations (arXiv:2602.07964v2, Feb 2026), https://arxiv.org/abs/2602.07964v2].\n- Parametricity**: Parametricity is a property of type systems that yields strong uniformity and modularity. In recent years, various systems of dependent type theory have been developed to express parametric reasoning [Parametricity via Cohesion (arXiv:2404.03825v3, Apr 2024), https://arxiv.org/abs/2404.03825v3].\n- Univalent foundations and double categories**: Category theory unifies mathematical concepts and has influenced functional programming and semantics; double categories serve as a case study for applying univalent foundations to computer science [Insights From Univalent Foundations: A Case Study Using Double Categories (arXiv:2402.05265v1, Feb 2024), https://arxiv.org/abs/2402.05265v1].\n- Dagger categories and fixed points**: The dagger operation connects two distinct notions: taking the adjoint of a morphism in dagger categories and finding the least fixed point of a functional in categories enriched in domains, bridging previously separate areas [Inversion, Iteration, and the Art of Dual Wielding (arXiv:1904.01679v1, Apr 2019), https://arxiv.org/abs/1904.01679v1].\n\n## Analysis\n- **Biproduct-oriented linear algebra**: Matrices are treated as morphisms in a category with biproducts, enabling an index‑free, calculational approach to matrix algebra and formalizing code generation for linear algebra applications [Typing linear algebra: A biproduct-oriented approach (arXiv:1312.4818v1, Dec 2013), https://arxiv.org/abs/1312.4818v1].\n\n- **Multicategories**: Multicategories extend traditional categories to handle multi‑input operations, provid","keywords":["mathematics-cs-theory","sentinel_research","trinity-research"],"about":[],"citation":["https://arxiv.org/abs/2602.07964v2","https://arxiv.org/abs/2404.03825v3","https://arxiv.org/abs/2402.05265v1","https://arxiv.org/abs/1904.01679v1","https://arxiv.org/abs/1312.4818v1","https://arxiv.org/abs/2511.13674v1","https://arxiv.org/abs/2510.08692v1"],"isPartOf":{"@type":"Dataset","name":"Froggit.ai Knowledge Graph","url":"https://froggit.ai"},"publisher":{"@type":"Organization","name":"Froggit.ai","url":"https://froggit.ai"},"dateCreated":"2026-07-31T07:27:20.779787Z","dateModified":"2026-07-31T07:27:22.030000Z","isBasedOn":"https://arxiv.org/abs/2602.07964v2","additionalProperty":[{"@type":"PropertyValue","name":"trust_level","value":100},{"@type":"PropertyValue","name":"verification_status","value":"sources_verified"},{"@type":"PropertyValue","name":"provenance_status","value":"valid"},{"@type":"PropertyValue","name":"evidence_level","value":"verified_report"},{"@type":"PropertyValue","name":"content_hash","value":"6cefe4f16e5fda10e34deaf29b05b71a035697afcf911623c3e82ab79f3984bd"}]}