International Symposium on Theoretical Programming [1 ed.] 3540067205, 9783540067207 [DJVU]

Table of contents :
An axiomatic definition of the programming language PASCAL....Pages 1-16
The logic of "can do"....Pages 17-28
Copying in commutation — Operator schemata....Pages 29-55
On synthesizing programs given by examples....Pages 56-63
Central technical issues in programming language design....Pages 64-75
Sur quelques systémes de programmation pour les recherches scientifiques....Pages 76-84
Decision problems in computational models....Pages 85-85
Non-determined algorithm schemata or R-schemata....Pages 86-110
Equivalence and optimization of programs....Pages 111-123
On the average speed of automaton with terminal state....Pages 124-126
Logical-termal equivalence of program schemata....Pages 127-143
On universal classes of program schemas....Pages 144-151
Certain decompositions of Gödel numbering and the semantics of programming languages....Pages 152-171
Criteria for the algorithmic completeness of the systems of operations....Pages 172-186
Data flow schemas....Pages 187-216
Operation patterns....Pages 217-246
Looking for an approach to a theory of models for parallel computation....Pages 247-284
Configurable computers: A new class of general purpose machines....Pages 285-298
A method for determining program data relationships....Pages 299-308
Towards automatical construction of parallel programs....Pages 309-331
A calculus for the mathematical theory of computation....Pages 332-343
Admissibility of fixed-point induction in first-order logic of typed theories....Pages 344-383
A formal approximation theory of semantic data types....Pages 384-393
Some features of a language for a proof-checking programming system....Pages 394-407