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
  • Good
  • Hardback
Used - Good

Description

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$73.08
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)
The BIBLIO Guarantee

Details

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

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

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

Please wait a moment while we load the requested page.

tracking-