International Symposium on Theoretical Programming
(Sprache: Englisch, Französisch)
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¿s de...
Leider schon ausverkauft
versandkostenfrei
Buch
37.44 €
Produktdetails
Produktinformationen zu „International Symposium on Theoretical Programming “
Klappentext zu „International Symposium on Theoretical Programming “
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¿s 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.
Inhaltsverzeichnis zu „International Symposium on Theoretical Programming “
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.
Bibliographische Angaben
- 1974, 420 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch/Französisch
- Herausgegeben: V. A. Nepomniaschy, A. Ershov
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3540067205
- ISBN-13: 9783540067207
- Erscheinungsdatum: 06.05.1974
Sprache:
Englisch, Französisch
Kommentar zu "International Symposium on Theoretical Programming"
0 Gebrauchte Artikel zu „International Symposium on Theoretical Programming“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "International Symposium on Theoretical Programming".
Kommentar verfassen