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).

"About this title" may belong to another edition of this title.

Store Description

GuthrieBooks has served central Texas with a choice selection since 1978. We strive to provide an interesting selection and quality service. We specialize in academic works but carry books for all interests.

Visit Seller's Storefront

Seller's business information

GuthrieBooks
TX, U.S.A.

Terms of Sale:

At this time we accept payment through Visa or Mastercard.

Shipping Terms:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Payment Methods
accepted by seller

Add to Wants

Items related to From Logic Design to Logic Programming: Theorem Proving...

From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions (Lecture Notes in Computer Science)

Snyers, Dominique; Thayse, Andre

Used - Soft cover

Seller's business information