Computer program synthesis methodologies : proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28-October 10, 1981
著者
書誌事項
Computer program synthesis methodologies : proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28-October 10, 1981
(NATO advanced study institutes series, ser. C . Mathematical and physical sciences ; v. 95)
D. Reidel Pub. Co. , Distributed in the U.S.A. and Canada by Kluwer Boston Inc., c1983
大学図書館所蔵 全19件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
"Published in cooperation with NATO Scientific Affairs Division."
Includes bibliographies and indexes
内容説明・目次
内容説明
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.
目次
Program Construction by Transformations: A Family Tree of Sorting Programs.- Issues in the Methodical Design of Concurrent Programs.- An Analysis of Choice in Program Design.- The Design of Very High Level Languages.- Implementation Considerations in Very High Level Languages.- A Study of Prolog.- Program Synthesis from Examples of Behavior.- Deductive Synthesis of the Unification Algorithm.- The Synthesis of Implementations for Abstract Data Types, A Program Transformation Tactic.- Natural Language Programming.- Author Index.
「Nielsen BookData」 より