The specification for (⊸) is a category homomorphism (µ id = id, µ(g ∘ f) = µg ∘ µf), leading to a correct-by-construction implementation.

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• µ is an applicative homomorphism: µ(pure a) = pure a and µ(imf <*> imx) = µ imf <*> µ imx.claim0.864
  Result for Image applicative specification.
• µ is a functor homomorphism: µ ∘ fmap = fmap ∘ µ.claim0.848
  Result for Image functor specification.
• µ is a monoid homomorphism: µ distributes over monoid operations.claim0.826
  Derived result for Image monoid specification.
• Homomorphism as Specificationclaim0.800
  Denotation acts as algebraic homomorphism, making implementations correct-by-construction when they satisfy this property
• If a semantic function is a homomorphism with respect to a type class, the implemented instance automatically satisfies the class laws.hypothesis0.775
  Core hypothesis enabling 'laws for free': denotational semantics guarantee algebraic law satisfaction.
• What standard abstraction to use for (⊸)?question0.771
  Question prompting the use of Category for linear transformations.
• Steering vectors from µ(0→2) slightly outperform µ(1→2) for instruction discovery across datasets and modelsfinding0.765
  Shows that contrasting No Reflection with Triggered Reflection provides a stronger signal than Intrinsic vs Triggered.
• Laws for free from semantic homomorphism.claim0.755