I.Kashirin

Каширин И.Ю.

Home ICF+ ontologies ICF ontologies (papers)Template Details Advanced StuffFlash Gallery Alternative

Flash Gallery Alternative

ICF+ ontologies

Program machines

The formalism of software machines makes it possible to mathematically strictly describe the concept of the conceptual integrity of a programming language. To get a formalism focused on analyzing the basic structures of an algorithmic language, let's look his structural components.

INTERRELATION

The Program Machines system can be considered in various combinations as higher-level formalisms. The connection between the components can be seen at the level of the structure of the construction of elements of the carrier sets of the algebraic systems discussed above.

programming languages

Let's consider the use of algebraic interpretation of language constructs for PL C, Lisp and Prolog as the most well-known algorithmic languages, which are representatives of languages of the universal, functional and logical type, respectively. Optimizing transformations are possible.

UNIFICATION

If the terms s and t represent a formal record of programs some predetermined program machine, then we are talking not simply about unifying or comparing two programs in order to find common fragments in them, but about an attempt to find some third term containing variables.

Igor Kashirin, 9 Ryumin Grove
Ryazan region, 390005, RF