A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic Concepts

Authors:
Rimma I. Podlovchenko
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 5
Cited 0

An algorithm deciding functional equivalence in a new class of program schemes

Theoretical Computer Science - Special issue on the Second French-Soviet Workshop on Methods of Compilation and Program Construction, Nice, France, Feb. 1988
On Ianov's Program Schemata

Journal of the ACM (JACM)
On programming of arithmetic operations

Communications of the ACM
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to survey the advent and maturation of the theory of program schemes, emphasize the fundamental contributions of A. A. Lyapunov and A.P. Ershov in this branch of computer science, and discuss the main trends in the theory of program schemes.