Skip to content
Register Sign in Wishlist

Deductive and Declarative Programming

$56.00 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: November 2006
  • availability: Available
  • format: Paperback
  • isbn: 9780521032513

$ 56.00 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • In this book, the author develops deduction-oriented methods for reasoning about functional and logic programs. The methods are based on the inductive theories of suitable data type specifications and exploit both classical theorem-proving and term rewriting. Detailed examples accompany the development of the methods, and their use is supported by a prototyping system that is documented at the end of the book.

    Reviews & endorsements

    "...promotes specification and programming on the basis of Horn logic with equality....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 documented prototyping system." Xiang Li, Mathematical Reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: November 2006
    • format: Paperback
    • isbn: 9780521032513
    • length: 288 pages
    • dimensions: 228 x 152 x 17 mm
    • weight: 0.469kg
    • availability: Available
  • Table of Contents

    1. Preliminaries
    2. Guards, generators and constructors
    3. Models and correctness
    4. Computing goal solutions
    5. Inductive expansion
    6. Directed expansion and reduction
    7. Implications of ground confluence
    8. Examples
    9. EXPANDER: inductive expansion in SML

  • Author

    Peter Padawitz

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.