International Symposium on Theoretical Programming. Lecture notes in computer science ; 5

Ershov, Andrej and Valery A. Nepomniaschy:

ISBN 10: 3540067205 / ISBN 13: 9783540067207

Editore: Berlin, Heidelberg, New York : Springer, 1974

Riguardo questo articolo

407 Seiten; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Einbandkanten sind leicht bestoßen. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 660.

Codice articolo 1805357

Dati bibliografici

• Titolo: International Symposium on Theoretical Programming. Lecture notes in computer science ; 5
• Editore: Berlin, Heidelberg, New York : Springer
• Data di pubblicazione: 1974
• Lingua: Inglese
• ISBN 10: 3540067205
• ISBN 13: 9783540067207
• Rilegatura: Broschiert
• Condizione: Gut
• Cataloghi dei venditori:
  • 202 Informatik & EDV

Descrizione articolo

Contenuti

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.