Lecture Notes in Computer Science

Theorem Proving Techniques and P-Functions

By: Dominique Snyers, Andre Thayse

Write A Review

Paperback | 12 August 1987

At a Glance

Paperback
136 Pages

Dimensions(cm)
23.39 x 15.6 x 0.74

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.