THE DENOTATIONAL SEMANTICS OF PROCEDURAL PROGRAMS (the solution to the problem of variables’ number minimization)

M. M. Aghasian

doi:10.46991/PYSUA.2002.36.3.023

THE DENOTATIONAL SEMANTICS OF PROCEDURAL PROGRAMS (the solution to the problem of variables’ number minimization)

Authors

M. M. Aghasian Chair of Computer Programming, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSUA.2002.36.3.023

Keywords:

algorithm, procedural language, mathematical model

Abstract

In this article an algorithm is described, which brings every program, written in procedural language, to conformity with such a system of functional equations, that defines its denotational semantics and in each equation the number of variables is minimal. The algorithm uses the mathematical model, for which the existence of the least element is proved.

Downloads

Published

2002-09-20

Issue

Vol. 36 No. 3 (199) (2002)

Section

Informatics

License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

How to Cite

Aghasian, M. M. (2002). THE DENOTATIONAL SEMANTICS OF PROCEDURAL PROGRAMS (the solution to the problem of variables’ number minimization). Proceedings of the YSU A: Physical and Mathematical Sciences, 36(3 (199), 23-30. https://doi.org/10.46991/PYSUA.2002.36.3.023