Del 5 - Lecture Notes in Computer Science

International Symposium on Theoretical Programming

Häftad, Engelska, 1974

Av A. Ershov, V.A. Nepomniaschy, V. a. Nepomniaschy, V. A. Nepomniaschy

519 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1974-05-06
Mått170 x 250 x 23 mm
Vikt633 g
FormatHäftad
SpråkEngelska, Franska
SerieLecture Notes in Computer Science
Antal sidor407
Upplaga1974
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540067207

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

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.

Du kanske också är intresserad av