Logic-term equivalence of program schemata

A. P. Ershov, “Theory of program schemata,” IFIP Congress 71 [in Russian], Lyublyan, August 23–28, 1971.Google Scholar

A. P. Ershov and A. A. Lyapunov, “Formalization of the program concept,” Kibernetika, No. 5 (1967).Google Scholar

A. P. Ershov, “Operator algorithms. II,” in: Problems of Cybernetics [in Russian], Vol. 8, Fizmatgiz, Moscow (1962).Google Scholar

A. P. Ershov, “Yanov's operator schemata,” in: Problems of Cybernetics [in Russian], Vol. 20, Izd. Nauka, Moscow (1967).Google Scholar

A. P. Ershov, “Reduction of the memory allocation problem in programming to the problem of coloring the vertices of a graph,” Dokl. Akad. Nauk SSSR,142, No. 4 (1962).Google Scholar

A. P. Ershov, “Operator schemata over a common and over a distributed memory,”. Kibernetika, No. 4 (1968).Google Scholar

A. A. Letichevskii, “Functional equivalence of discrete transducers. I,” Kibernetika, No. 2 (1969).Google Scholar

A. A. Letichevskii, “Functional equivalence of discrete transducers. II,” Kibernetika, No. 2 (1970).Google Scholar

V. A. Nepomnyashchii, “A method of deciding the equivalence of program schemata and discrete transducers,” Proc. Second All-Union Conf. Programming [in Russian], Novosibirsk, February 3–6 (1971).Google Scholar

V. E. Kotov, Transformation of Operator Schemata into Asynchronous Programs (Author's Abstract of Dissertation) [in Russian], VTs SO AN SSSR, Novosibirsk (1970).Google Scholar

A. S. Narin'yani, Asynchronous Computation Processes, over a Common Memory, Author's Abstract of Dissertation, Computer Center, Siberian Branch of the Academy of Sciences of the USSR, Novosibrirsk (1970).Google Scholar

V. É. Itkin and Z. Yu. Zvinogrodskii, “Equivalence of program schemata,”. J. Comp. Syst. Sci.,5 (1971).Google Scholar