Abstract
Schemes of programs without procedures are considered, and a rich family of scheme equivalences is studied. The structure of equivalent schemes is analyzed in order to build transformation systems that are complete with respect to equivalences from this family. The first result of the research is reported, which is that all equivalences from the family in question are solvable.
Similar content being viewed by others
References
Podlovchenko, R.I., From Yanov’s Schemes to the Theory of Program Models, inMathematicheskie voprosy kibernetiki (Mathematical Problems of Cybernetics), Moscow: Nauka, 1998, issue 7, pp. 281–302.
Podlovchenko, R.I. and Airapetyan, M.G., On the Construction of Complete Systems of Equivalent Transformations of Program Schemes,Programmirovanie, 1996, no. 1, pp. 3–29.
Podlovchenko, R.I., A Canonization Algorithm for Pairs of Program Schemes with Commuting Operators,Programmirovanie, 1997, no. 6, pp. 3–16.
Podlovchenko, R.I., A Transformation System Complete in the Class of Program Schemes with Commuting Operators,Programmirovanie, 1998, no. 2, pp. 58–67.
Glushkov, V.M. and Letichevskii, A.A., The Theory of Discrete Transformers, inIzbrannye voprosy algebry i logiki (Selected Issues of Algebra and Logics), Novosibirsk: Nauka, 1973, pp. 5–39.
Zakharov, V.A., Fast Algorithms for Solving the Equivalence of Operator Programs on Balanced Scales, inMatematicheskie voprosy kibernetiki (Mathematical Problems of Cybernetics), Moscow: Nauka, 1998, issue 7, pp. 303–324.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Podlovchenko, R.I. On a general solution to the problem of equivalent transformations of program schemes. Program Comput Soft 26, 44–52 (2000). https://doi.org/10.1007/BF02759181
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759181