Cantitate/Preț
Produs

International Symposium on Theoretical Programming: Lecture Notes in Computer Science, cartea 5

Editat de A. Ershov, V.A. Nepomniaschy
en Limba Engleză Paperback – 6 mai 1974

Din seria Lecture Notes in Computer Science

Preț: 30381 lei

Preț vechi: 37975 lei
-20% Nou

Puncte Express: 456

Preț estimativ în valută:
5815 6100$ 4824£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540067207
ISBN-10: 3540067205
Pagini: 420
Ilustrații: VIII, 407 p.
Dimensiuni: 170 x 250 x 22 mm
Greutate: 0.59 kg
Ediția:1974
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.