ENGLISH

From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions

By André Thayse (auth.) , Dominique Snyers

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1987
ISBN
3540182179, 9783540182177
DOI
10.1007/3-540-18217-9
Language
english
Format
DJVU
Filesize
1 MB (1134199 bytes)
Series
Lecture Notes in Computer Science 271
Edition
1
Pages
125\129
Library
Kolxo3
DPI
300
Time added
2011-07-22 07:35:22
Logics and Meanings of Programs; Programming Techn

Description

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

Similar books