International Symposium on Theoretical Programming

Ershov, A. & V. A. Nepomniaschy

ISBN 10: 3540067205 / ISBN 13: 9783540067207

Editore: Springer, Berlin, 1974

Riguardo questo articolo

Lecture Notes In Computer Science, 5; 6.1 X 0.96 X 9.25 inches; 407 pages; Ex-Library copy with usual identifiers. Light wear on cover edges and on the head of the spine. Minor fading and rubbing on the covers. Good condition otherwise. No other noteworthy defects. No markings on text pages. ; - Your satisfaction is our priority. We offer free returns and respond promptly to all inquiries. Your item will be carefully cushioned in bubble wrap and securely boxed. All orders ship on the same or next business day. Buy with confidence. 1st Edition (Unstated); No Printing Stated.

Codice articolo TOB224-60378-A-4.61

Dati bibliografici

• Titolo: International Symposium on Theoretical Programming
• Editore: Springer, Berlin
• Data di pubblicazione: 1974
• Lingua: Inglese
• ISBN 10: 3540067205
• ISBN 13: 9783540067207
• Rilegatura: Paperback
• Edizione: prima edizione
• Condizione: Good

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.