×
![]( "Buchcover ISBN 9783540067207")
Inhaltsverzeichnis
- An axiomatic definition of the programming language PASCAL.
- The logic of „can do“.
- Copying in commutation — Operator schemata.
- On synthesizing programs given by examples.
- Central technical issues in programming language design.
- Sur quelques systémes de programmation pour les recherches scientifiques.
- Decision problems in computational models.
- Non-determined algorithm schemata or R-schemata.
- Equivalence and optimization of programs.
- On the average speed of automaton with terminal state.
- Logical-termal equivalence of program schemata.
- On universal classes of program schemas.
- Certain decompositions of Gödel numbering and the semantics of programming languages.
- Criteria for the algorithmic completeness of the systems of operations.
- Data flow schemas.
- Operation patterns.
- Looking for an approach to a theory of models for parallel computation.
- Configurable computers: A new class of general purpose machines.
- A method for determining program data relationships.
- Towards automatical construction of parallel programs.
- A calculus for the mathematical theory of computation.
- Admissibility of fixed-point induction in first-order logic of typed theories.
- A formal approximation theory of semantic data types.
- Some features of a language for a proof-checking programming system.
