A.6.1:3 - Forces · fpf.tools

Force	Tension
Reuse and semantic locality	Reusers need stable operation meaning, while every use has an effective `U.ReferenceScheme` and bounded Applicability.
Law and admission	Laws state reusable regularities; admission predicates decide whether one proposed operation use is admissible.
Declaration and realization	A declaration can have several realizers; changing one realizer does not by itself change declaration identity.
Light use and typed reuse	One readable operation sentence is often enough, while repeated use may need exact argument and result declarations; a receiving claim about one use may additionally need a particular application and its bindings.
Domain breadth and kind precision	The same form serves physical engineering, medicine, learning, and software without treating code or documents as the default object.
Mathematical precision and ontology	Algebraic notation can expose preservation claims, but a mathematical lens does not decide the FPF kind by form.
Recall and conditional structure	A short mantra helps a reader remember the distinctions; A.22.CGUS applies only when selected relations and constraints define one reusable structure with at least two potential continuations.