Theoretical Programming 1972: Novosibirsk, Russia

Andrei P. Ershov, V. A. Nepomniaschy (Eds.): International Sympoisum on Theoretical Programming, Novosibirsk, Russia, August 7-11, 1972, Proceedings. Lecture Notes in Computer Science 5 Springer 1974, ISBN 3-540-06720-5 BibTeX

@proceedings{DBLP:conf/ershov/1972,
  editor    = {Andrei P. Ershov and
               V. A. Nepomniaschy},
  title     = {International Sympoisum on Theoretical Programming, Novosibirsk,
               Russia, August 7-11, 1972, Proceedings},
  booktitle = {International Sympoisum on Theoretical Programming},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {5},
  year      = {1974},
  isbn      = {3-540-06720-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

C. A. R. Hoare: An axiomatic definition of the programming language PASCAL. 1-16 BibTeX
Erwin Engeler: The logic of "can do". 17-28 BibTeX
M. I. Schwartzman: Copying in commutation - operator schemata. 29-55 BibTeX
Janis Barzdin: On synthesizing programs given by examples. 56-63 BibTeX
J. Schwartz: Central technical issues in programming language design. 64-75 BibTeX
A. A. Liapounov: Sur quelques systèmes de programmation pour les recherches scientifiques. 76-84 BibTeX
Mike Paterson: Decision problems in compputation models. 85-85 BibTeX
Rimma I. Podlovchenko: Non- determined algorithm schemata or R- schemata. 86-110 BibTeX
A. A. Letichervsky: Equivalence and optimization of programs. 111-123 BibTeX
Ju. H. Shukurian: On the average speed of automation with terminal state. 124-126 BibTeX
V. E. Itkin: Local- termal equivalence of program schemata. 127-143 BibTeX
B. A. Trachtenbrot: On universal classes of program schemas. 144-151 BibTeX
Bruno Buchberger: Certain decompositions of Gödel numbering and the semantics of programming languages. 152-171 BibTeX
V. A. Nepomniaschy: Criteria for the algorithmic completeness of the systems of operations. 172-186 BibTeX
Jack B. Dennis, John B. Fosseen, John P. Linderman: Data flow schemas. 187-216 BibTeX
A. Bährs: Operation patterns. 217-246 BibTeX
A. S. Narinyani: Looking for an approach to a theory of models for parallel computation. 247-284 BibTeX
Raymond E. Miller, John Cocke: Configurable computers: a new class of general purpose machines. 285-298 BibTeX
P. E. Allen: A method for determining program data relationships. 299-308 BibTeX
V. E. Kotov: Towards automtical construction of parallel programs. 309-331 BibTeX
Robin Milner: A calculus for the mathematical theory of computation. 332-343 BibTeX
Shigeru Igarashi: Admissibility of fixed-point induction in first- order logic of typed theories. 344-383 BibTeX
Takayasu Ito: A formal approximation theory of semantic data types. 384-393 BibTeX
Gregory S. Tseytin: Some feature of a language for a proof- checking programming system. 394-407 BibTeX