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

Contenuti:

Theorem in proving and P-functions.- Grammars, logics and declarative programming.- Grammars and Semantics.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

Visita la pagina della libreria

Informazioni sull?azienda del venditore

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Condizioni di vendita:

TBA

Condizioni di spedizione:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Metodi di pagamento
accettati dalla libreria

Aggiungi ai desiderata

Articoli correlati a From Logic Design to Logic Programming: Theorem Proving...

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

Dominique Snyers, Andre Thayse

Nuovi - Brossura

Informazioni sull?azienda del venditore