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

Snyers, Dominique; Thayse, Andre

ISBN 10: 3540182179 / ISBN 13: 9783540182177

Published by Springer, 1987

About this Item

Seller Inventory # ABLIING23Mar3113020161652

Bibliographic Details

• Title: From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions (Lecture Notes in Computer Science, 271)
• Publisher: Springer
• Publication Date: 1987
• Language: English
• ISBN 10: 3540182179
• ISBN 13: 9783540182177
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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