Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions

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

Snyers, Dominique
Thayse, Andre

Paperback

Series: Lecture Notes in Computer Science, Book 271

FictionGeneral ComputersProgramming

ISBN10: 3540182179
ISBN13: 9783540182177
Publisher: Springer Nature
Published: Aug 12 1987
Pages: 125
Weight: 0.44
Height: 0.29 Width: 6.14 Depth: 9.21
Language: English
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).

Also in

Fiction

View All