Morphisms and Transformations

The UOR Transforms and Morphisms namespace defines the maps between UOR objects. Where the kernel namespaces declare what objects are, and bridge namespaces compute how to resolve them, morphisms specify how objects relate to each other through structure-preserving transformations.

The Transform Hierarchy

Every morphism is a Transform — a map with a source, a target, and a declaration of what structure it preserves. Specialisations include:

Composition

Transforms compose. The Composition class records the sequential application of two or more transforms, while the CompositionLaw governs how operations combine. The critical composition law — neg compose bnot = succ — is the algebraic backbone of the entire framework.

Grounding and Projection

Two special transforms connect the abstract algebra to concrete representation:

Together they form a round-trip: ground, resolve, then project. The GroundingCertificate attests that a grounding round-trip satisfied the shared-frame condition.

Computational Morphisms

Higher-order transforms treat computation itself as data. A ComputationDatum is a datum whose ring value is the content address of a certificate; an ApplicationMorphism applies such a datum to an input, and PartialApplication fixes some inputs while leaving others free.

Connection to Sites

Morphisms interact tightly with the Site Bundle Semantics decomposition. An embedding across Witt levels maps sites in the source type to sites in the target, and the The Partition Decomposition decomposition must respect the structure that morphisms preserve.