CMP.16:10 - Architectural Rationale
The intended whole constrains the units, and attempted composition tests that choice. This makes synthesis and abstraction mutually informative without identifying them. The fragment example constructs a new summary from the observation needed at the join; the grant example constructs an operation boundary from a continuing state condition. A general claim follows only after the allowed constructions and their preservation grounds have been established.
Choosing a data structure is a serious alternative when the operations are already adequate; CMP.10 supplies it. Recursive decomposition is useful when subproblems and sufficient returns yield a finite answer; CMP.2 supplies that construction. Direct validation of a complete candidate can be cheaper than restricting every intermediate state. The present method is needed when units and operations must change together to make the whole obtainable or its repeated use tractable. CMP.13’s approximate analysis can help establish a property, but it has a different result from the computational interface being designed.
The method permits several levels and several implementations. Reveal the detail that the receiving observation or resource argument needs; keep a boundary only where its promised independence is justified.