18: Methods in relation to styles

We consider only the highest level methods. Their concretization (for example, the dynamic programming method as concretization of the data flow method), of course, obey the general laws, but due to greater concreteness they can either smooth them out or sharpen ¹ . For example, the dynamic programming method leads to almost hopeless inefficiency or lack of aesthetics of programs in all styles, except for the cyclical version of the structural style.

We give the first version of the summary of known compatibility and incompatibility. It is not in tabular form, since its points often require comments.

1. Data flow method

   It is perfectly combined with structured programming in its cyclic form. Even if the data stream is too complicated to directly represent as a data structure in a program, it is the core of the understanding and restructuring of the algorithm, making it aware of and documenting the data network.

   It goes well with:

   • with programming from events, if the data itself is not too complex, and their relationships in the stream are dynamic;
   • With probationary programming in the form of instantiation, if the data are wide enough, they are hierarchically structured, and their restructuring is mostly global.

   It is badly combined with potential methods of unification and returns, programming from priorities, functional programming, automatic programming.
2. The method of tables.

   It is perfectly combined with automata programming both in serial and in parallel form.

   It is well combined with sentence programming in both types and with programming from priorities.

   Satisfactorily combined with functional programming.

   It is badly combined with event-based programming and with structured programming in both forms.
3. Top-down design method.

   It is perfectly combined with structured programming in both forms, with functional programming and with the unification variant of the sentence.

   Satisfactory or poorly combined with all others.
4. Upstream design method.

   It is perfectly combined with all forms of event and machine programming.

   Satisfactory or poorly combined with the rest.
5. The programming method is wide.

   It is perfectly combined with sentence programming, with event and automatic programming.

   It is badly combined with structural and functional programming (they require too much ordering of knowledge, which in this case is achievable only at the final stages).
6. Macro-permutation method.

   It is perfectly combined with functional and potential programming.

   It is badly combined with the others.
7. The method of dynamic program generation.

   It is perfectly combined with functional and potential programming.

   It is badly combined with the others.
8. Method of induction and invariants.

   It is perfectly combined with the recursive option of structured programming.

   It is well combined with a cyclic version of recursive programming, when the data flow is simple, and with a unification variant of Sentential programming.

   It is badly combined with all the others.