CMP.16:11 - SoTA-Echoing
Dijkstra’s Notes on Structured Programming, EWD249 provide a historical argument for developing data organization and operations together and for reasoning across levels while constructing a program. This construction also applies when the units perform concurrent work, as in :5.2.
SICP’s abstraction barriers give a historical worked account of clients using operations independently of a selected lower representation. Here the boundary is selected from the required whole and includes consequential continuing behavior. A simpler direct representation remains preferable when the boundary adds no useful independence.
The maintained Verified Functional Algorithms chapter on abstract data types makes interfaces, operation specifications and implementation proof obligations explicit through executable formal examples. It supplies a stronger checking option when those obligations warrant mechanization. A module signature can enforce the exposed structure; the stated behavioral laws still need their proofs.
MATH.17 and MATH.18 supply the composition and interpretation grounds used here. CMP.12 and CMP.14 carry the developed alternatives needed when control, effects or interaction change those grounds. Reopen a design when a new required observation, affordable implementation, admissible operation or execution condition changes the balance among these alternatives.