Abstract levels of programming theorems
Tibor Gregorics · 2012
In this paper three abstract levels of programming theorems are introduced. These levels depend on the form of the sequence of the elements that are produced by a programming theorem. We are going to investigate the dierence between the solutions of the same problem if these solutions are derived from altering abstract levels of the same programming theorem. One of the famous programming theorems, the maximum selection, is chosen as an example, all of its three versions will be presented, and their usage will be shown in a case study.