Каширин И.Ю.

See other templatesSee other templates

Multilingual Support

In our templates all wordings of both back-end and front-end are moved to separated language files, so you can easily translate them into any language you want.

Showlist data is not configured
Click to learn more

Interactive images presentation by JSN ImageShow extension

!-

Currently our templates support more then 10 languages and more to be come in future.

English support
English
German support
German
Dutch support
Dutch
Italian support
Italian
Spanish support
Spanish
French support
French
Japanese support
Japanese
Danish support
Danish
Russian support
Russian
Polish support
Polish

-->

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.

Read more...

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.

Read more...

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.

 Read more...

UNIFICATION

Excelsior

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.

Read more...

Go to top