C. A. R. Hoare An axiomatic definition of the programming language PASCAL. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:1-16 [Conf]
Erwin Engeler The logic of "can do". [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:17-28 [Conf]
M. I. Schwartzman Copying in commutation - operator schemata. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:29-55 [Conf]
Janis Barzdin On synthesizing programs given by examples. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:56-63 [Conf]
J. Schwartz Central technical issues in programming language design. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:64-75 [Conf]
A. A. Liapounov Sur quelques systèmes de programmation pour les recherches scientifiques. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:76-84 [Conf]
Mike Paterson Decision problems in computational models. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:85-85 [Conf]
Rimma I. Podlovchenko Non- determined algorithm schemata or R- schemata. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:86-110 [Conf]
A. A. Letichervsky Equivalence and optimization of programs. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:111-123 [Conf]
Ju. H. Shukurian On the average speed of automation with terminal state. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:124-126 [Conf]
V. E. Itkin Local- termal equivalence of program schemata. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:127-143 [Conf]
B. A. Trachtenbrot On universal classes of program schemas. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:144-151 [Conf]
Bruno Buchberger Certain decompositions of Gödel numbering and the semantics of programming languages. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:152-171 [Conf]
V. A. Nepomniaschy Criteria for the algorithmic completeness of the systems of operations. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:172-186 [Conf]
A. Bährs Operation patterns. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:217-246 [Conf]
A. S. Narinyani Looking for an approach to a theory of models for parallel computation. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:247-284 [Conf]
Raymond E. Miller, John Cocke Configurable computers: a new class of general purpose machines. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:285-298 [Conf]
P. E. Allen A method for determining program data relationships. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:299-308 [Conf]
V. E. Kotov Towards automtical construction of parallel programs. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:309-331 [Conf]
Robin Milner A calculus for the mathematical theory of computation. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:332-343 [Conf]
Shigeru Igarashi Admissibility of fixed-point induction in first- order logic of typed theories. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:344-383 [Conf]
Takayasu Ito A formal approximation theory of semantic data types. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:384-393 [Conf]
Gregory S. Tseytin Some feature of a language for a proof- checking programming system. [Citation Graph (0, 0)][DBLP] International Sympoisum on Theoretical Programming, 1972, pp:394-407 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
