A trivial diamond of computation would be a custom purpose machine, e.g. [0]. Inter-operation between decoupled "small abstractions" and their composed descend

A trivial diamond of computation would be a custom purpose machine, e.g. [0]. Inter-operation between decoupled "small abstractions" and their composed descendants requires either a pre-existing mutual interchange form, or a set of wrappers that provide the same. This is equivalent to simply building on top of that common normal form, which exists, at varying levels of specificity and accessibility, whether one explicitly considers it or not [1]. This, combined with the ultimate CNF still being natural language, because computational semantics are still ultimately evaluated in the context of the human brain, argues for intentionally clarifying and improving that least common computational denominator, in the same way that if one entirely lapses in their recollection of higher synthetic geometry, "begin by assuming a compass and straightedge" is at the least never incorrect. [0] https://news.ycombinator.com/item?id=13669033 https://news.ycombinator.com/item?id=13669033 [1] E.g. the cons example in the article is a small abstraction that composes well, at the abstract level, with the cond abstraction for destructuring quoted symbol lists when writing interpreters, but as noted by the author leaks too much of the underlying machine primitives, and thus is an impedance mismatch when seeking performance optimizations, as in a compiler.