arXiv (All)
open access
You may implement this later: Cofunctors as partial implementations
A functor is a familiar model of an implementation, where every operation in a specification is assigned a concrete instantiation at the outset. But some tasks are less eager: we often want to assemble systems while leaving backend choices such as data representations and algorithms for later. We ob
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Defining Boundary Knowledge Without Ontology#110508
- Stepwise refinement of formal specifications based on logical formulae : from CO-OPN/2 specifications to Java programs#445109
- Call Processing Language Framework and Requirements#139502
- Translatability: A New Criterion for Deciphering Reality, or The Standard of Structural Adequacy for Natural Laws and Mathematical Structures#687800
- Applied Category Theory for Formalizing Architecture, Behavior, and Design of Complex Systems: A Survey#1079554
Record · ID 974578
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive