Computer Program Synthesis Methodologies | Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28-October 10, 1981

A. W. Biermann (u. a.)

ISBN 10: 9400970218 / ISBN 13: 9789400970212

Published by Springer, 2011

About this Item

Computer Program Synthesis Methodologies | Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28-October 10, 1981 | A. W. Biermann (u. a.) | Taschenbuch | ix | Englisch | 2011 | Springer | EAN 9789400970212 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Seller Inventory # 105402580

Bibliographic Details

• Title: Computer Program Synthesis Methodologies | Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28-October 10, 1981
• Publisher: Springer
• Publication Date: 2011
• Language: English
• ISBN 10: 9400970218
• ISBN 13: 9789400970212
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 240W x 160H x 21D millimeters 240 millimeters width by 160 millimeters height by 21 millimeters depth
• Weight: 618 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti­ ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of­ control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage.