Main
From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions
From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions
Dominique Snyers, André Thayse (auth.)
5.0
/
5.0
0 comments
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).
Categories:
Year:
1987
Edition:
1
Publisher:
Springer-Verlag Berlin Heidelberg
Language:
English
Pages:
125
ISBN 10:
3540182179
ISBN 13:
9783540182177
ISBN:
3540182179,9783540182177
Series:
Lecture Notes in Computer Science 271
Your tags:
Logics and Meanings of Programs; Programming Techniques
This book is not available due to the complaint of the copyright holder.
Comments of this book
There are no comments yet.