top of page

L.C.P        Logic of Programs construction

Rules related to hierarchical subdivision:

Before writing our first program, I must state the basic rules that govern a hierarchical subdivision.

1 °) Accept the axiom : Any collection of data must be considered as a mathematical set. It is therefore necessary to associate it with a definition by understanding, in other words, make the list of the criteria of belonging to this set (or list of the properties).

2 °) Have an appropriate subdivision criterion. With respect to L.C.P, all data sets (input, output and program instructions) will be subdivided using the following criterion :

​

A data set is subdivided, If it comprises subsets present a number of times different from 1

3 °) Every Sub-Set is included in the immediately higher level data set.

=

The S-Set B is included in Set A

4°) An element of the lower level set corresponds to one and only one element in the upper-level set.

5°) When we put two sets in correspondence, this latter must be a mathematical application. That is, any element of the set taken as the starting set of the correspondence must correspond to one and only one element in the set of arrival.

6°) In a hierarchical subdivision, a S-Ensemble may be present (0 or 1 time) or (n times), The case of a S-Ensemble present (0 or n times) is solved as follows:

Presence or not of a group (0-1), and if group there is, presence of an S-E (n times)

7°) In a hierarchical subdivision, all Sub-sets at the same subdivision level are disjoint, when the presence of Sub-sets is optional (present (0-1 times), it must be specified whether the mathematical union of These, are feasible or not.

The + (Union) operator between two Sub-sets if their union is possible.

The operator           (Exclusion) between two Sub-sets if their union is impossible, ie the presence of one excludes the presence of the other.

Now that all these rules are familiar to you, let's continue our program !

bottom of page