DS-theory. Presentation of canonical algorithm by means of algorithmic language

V.G. Kolesnyk

Abstract


This work continues the description of the decomposition scheme as a theoretical model, which makes possible generation of the applied algorithms. The description of the algorithmic language made for show the possibility of algorithms generation is given. One of the factors' group is described, i.e. ways of placing the properties on the tape of the abstract type which when is taken into consideration allows to turn canonical algorithm into a real one and applied algorithm, which is the same as turning the decomposition scheme into the program text. The notions of algorithmic primitive and algorithmic joint (operand and operation) as the means for constructing the algorithm are introduced.  These notions of algorithms construction are the alternatives for the notional system and methods of structured programming. The notions of functional core, algorithmic frame, functional contents and algorithmic matrix are introduced.


Keywords


generation of the applied algorithms

Full Text:

PDF (Ukrainian)

References


Колесник В.Г. DS-теория как прототип теории прикладных алгоритмов // Проблеми програмування. – 2012. – № 1. – С. 17–33.

Robert Harper. Existential Type. What, If Anything, Is A Declarative Language? 18 July 2013.

Lloyd J.W. Practical Advantages of Declara-tive Programming. GULP-PRODE'94 1994 Joint Conference on Declarative Programming. Peniscola (Spain), September 19–22, 1994.

Дал У., Дейкстра Э., Хоор К. Структурное программирование (Математическое обеcпечение ЭВМ). – М.: Мир, 1975. – 248 с.


Refbacks

  • There are currently no refbacks.