A.6.1:2 - Problem
FPF needs reusable operation declarations for scope, normalization, selection, comparison, physical modeling, and other domains. Without one precise ontic:
- an operation name does not reveal its typed arguments or result;
- declared laws are mixed with admission predicates and evaluation outcomes;
- applicability is hidden behind an unexplained context label;
- a realization is confused with the declaration it realizes;
- mathematical notation or imperative prose is overread as an executable sequence;
- descriptions, publications, methods, and dated work acquire mechanism identity by proximity.
The repair is a small set of exact distinctions applied with progressive explicitness.