International Sympoisum on Theoretical Programming

Keyphrases

Publications

volume 5, 1974

International Sympoisum on Theoretical Programming, Novosibirsk, Russia, August 7-11, 1972, Proceedings International Sympoisum on Theoretical Programming 5 (1974)

1972

Robin Milner
A calculus for the mathematical theory of computation. International Sympoisum on Theoretical Programming (1972)
Shigeru Igarashi
Admissibility of fixed-point induction in first- order logic of typed theories. International Sympoisum on Theoretical Programming (1972)
B. A. Trachtenbrot
On universal classes of program schemas. International Sympoisum on Theoretical Programming (1972)
Alexander S. Narin'yani
Looking for an approach to a theory of models for parallel computation. International Sympoisum on Theoretical Programming (1972)
M. I. Schwartzman
Copying in commutation - operator schemata. International Sympoisum on Theoretical Programming (1972)
Takayasu Ito
A formal approximation theory of semantic data types. International Sympoisum on Theoretical Programming (1972)
V. E. Kotov
Towards automatical construction of parallel programs. International Sympoisum on Theoretical Programming (1972)
A. Bährs
Operation patterns. International Sympoisum on Theoretical Programming (1972)
Erwin Engeler
The logic of "can do". International Sympoisum on Theoretical Programming (1972)
A. A. Liapounov
Sur quelques systèmes de programmation pour les recherches scientifiques. International Sympoisum on Theoretical Programming (1972)
Jack B. Dennis, John B. Fosseen, John P. Linderman
Data flow schemas. International Sympoisum on Theoretical Programming (1972)
A. A. Letichervsky
Equivalence and optimization of programs. International Sympoisum on Theoretical Programming (1972)
J. Schwartz
Central technical issues in programming language design. International Sympoisum on Theoretical Programming (1972)
Raymond E. Miller, John Cocke
Configurable computers: a new class of general purpose machines. International Sympoisum on Theoretical Programming (1972)
P. E. Allen
A method for determining program data relationships. International Sympoisum on Theoretical Programming (1972)
V. E. Itkin
Local- termal equivalence of program schemata. International Sympoisum on Theoretical Programming (1972)
Rimma I. Podlovchenko
Non- determined algorithm schemata or R- schemata. International Sympoisum on Theoretical Programming (1972)
Gregory S. Tseytin
Some feature of a language for a proof- checking programming system. International Sympoisum on Theoretical Programming (1972)
Mike Paterson
Decision problems in computational models. International Sympoisum on Theoretical Programming (1972)
C. A. R. Hoare
An axiomatic definition of the programming language PASCAL. International Sympoisum on Theoretical Programming (1972)
Ju. H. Shukurian
On the average speed of automation with terminal state. International Sympoisum on Theoretical Programming (1972)
Valery A. Nepomniaschy
Criteria for the algorithmic completeness of the systems of operations. International Sympoisum on Theoretical Programming (1972)
Janis Barzdin
On synthesizing programs given by examples. International Sympoisum on Theoretical Programming (1972)
Bruno Buchberger
Certain decompositions of Gödel numbering and the semantics of programming languages. International Sympoisum on Theoretical Programming (1972)