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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Vereinigtes Königreich
Zustand: Good. Taping to the spine of the book. Corners are taped also. Inscription to the inside cover. Taping to the cover/page binding also. Fine to read. Bestandsnummer des Verkäufers 10295-4
Anzahl: 1 verfügbar
Anbieter: True Oak Books, Highland, NY, USA
Paperback. Zustand: Good. 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. Bestandsnummer des Verkäufers TOB224-60378-A-4.61
Anzahl: 1 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 5907580
Anzahl: 15 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 420 pp. Englisch, Französisch. Bestandsnummer des Verkäufers 9783540067207
Anzahl: 2 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 5907580-n
Anzahl: 15 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Bestandsnummer des Verkäufers ria9783540067207_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Books Puddle, Woodside, NY, USA
Zustand: New. pp. 420. Bestandsnummer des Verkäufers 263069312
Anzahl: 4 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 420 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Bestandsnummer des Verkäufers 5859935
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 420. Bestandsnummer des Verkäufers 183069322
Anzahl: 4 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9783540067207
Anzahl: 1 verfügbar