This work demonstrates that theorem-proving methods can lead to program synthesis and algorithm implementation by using pairs of logic 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).
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want