International Sympoisum on Theoretical Programming, Novosibirsk, Russia, August 7-11, 1972, Proceedings - researchr publication

researchr

You are not signed in
Sign in
Sign up

Andrei P. Ershov, V. A. Nepomniaschy, editors, International Sympoisum on Theoretical Programming, Novosibirsk, Russia, August 7-11, 1972, Proceedings. Volume 5 of Lecture Notes in Computer Science, Springer, 1974.

Conference: ershov1974

Abstract is missing.

An axiomatic definition of the programming language PASCALC. A. R. Hoare. 1-16

The logic of can do Erwin Engeler. 17-28

Copying in commutation - operator schemataM. I. Schwartzman. 29-55

On synthesizing programs given by examplesJanis Barzdin. 56-63

Central technical issues in programming language designJ. Schwartz. 64-75

Sur quelques systèmes de programmation pour les recherches scientifiquesA. A. Liapounov. 76-84

Decision problems in compputation modelsMike Paterson. 85-85

Non- determined algorithm schemata or R- schemataRimma I. Podlovchenko. 86-110

Equivalence and optimization of programsA. A. Letichervsky. 111-123

On the average speed of automation with terminal stateJu. H. Shukurian. 124-126

Local- termal equivalence of program schemataV. E. Itkin. 127-143

On universal classes of program schemasB. A. Trachtenbrot. 144-151

Certain decompositions of Gödel numbering and the semantics of programming languagesBruno Buchberger. 152-171

Criteria for the algorithmic completeness of the systems of operationsV. A. Nepomniaschy. 172-186

Data flow schemasJack B. Dennis, John B. Fosseen, John P. Linderman. 187-216

Operation patternsA. Bährs. 217-246

Looking for an approach to a theory of models for parallel computationA. S. Narinyani. 247-284

Configurable computers: a new class of general purpose machinesRaymond E. Miller, John Cocke. 285-298

A method for determining program data relationshipsP. E. Allen. 299-308

Towards automtical construction of parallel programsV. E. Kotov. 309-331

A calculus for the mathematical theory of computationRobin Milner. 332-343

Admissibility of fixed-point induction in first- order logic of typed theoriesShigeru Igarashi. 344-383

A formal approximation theory of semantic data typesTakayasu Ito. 384-393

Some feature of a language for a proof- checking programming systemGregory S. Tseytin. 394-407

runs on WebDSL