From logic design to logic programming : theorem proving techniques and P-functions
著者
書誌事項
From logic design to logic programming : theorem proving techniques and P-functions
（Lecture notes in computer science, 271）
Springer-Verlag, c1987
- : gw
- : us
大学図書館所蔵 件 / 全62件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Bibliography: p. [121]-125
内容説明・目次
内容説明
This work demonstrates that theorem-proving methods can lead to program synthesis and algorithm implementation by using pairs of logic laws: a deductive law for proving the theorem and a constructive law for synthesizing the program or algorithm. A systematic examination of deductive laws and of constructive laws is presented. The set of all possible pairs of laws provides us with a tool for classifying the different approaches for materializing algorithms (such as hardware, microprogramming, algorithmic programming, declarative programming, deductive approach for recursive routines).
目次
Theorem in proving and P-functions.- Grammars, logics and declarative programming.- Grammars and Semantics.
「Nielsen BookData」 より