BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Deductive and Declarative Programming (Cambridge Tracts in Theoretical Computer Science, Series Number 28)

Deductive and Declarative Programming (Cambridge Tracts in Theoretical Computer Science, Series Number 28)

Deductive and Declarative Programming (Cambridge Tracts in Theoretical Computer
Stock photo: cover may vary

Deductive and Declarative Programming (Cambridge Tracts in Theoretical Computer Science, Series Number 28) Hardback - 1992

by Padawitz, Peter

Add to wish list
  • Used
  • Hardback
  • first
Used: Good

Description

Cambridge University Press, 1992-10-30. First Edition. hardcover. Used: Good. 7.25x0.75x10.25. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$24.81
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Deductive and Declarative Programming (Cambridge Tracts in Theoretical Computer Science, Series Number 28)

From the publisher

Declarative, ie functional or logical programs consist of mathematical functions and relations and so they are amenable to formal specification and verification, as methods of proof and logic can be applied to the programs in a well defined manner. This book emphasizes verification based on logical inference rules, ie deduction (in contrast to model-theoretic approaches, deductive methods can be automated to a certain extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods whose use is supported by a prototyping system that is documented at the end of the book, which can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages.
tracking-