/
Deductive and Declarative Programming (Cambridge Tracts in Theoretical Computer Science, Series Number 28)
by Peter Padawitz (Author)★★★★★
★★★★★
|0 ratings
56.49
Prime
In Stock
FREE delivery Wednesday, June 25 Or Prime members get FREE delivery Monday, June 23. Order within 10 hrs 48 mins. Join Prime
Free delivery with Prime
56.49 USwith Prime
FREE delivery Wednesday, June 25 Or Prime members get FREE delivery Monday, June 23. Order within 10 hrs 48 mins. Join Prime
In Stock
Secure transaction
Ships from and sold by Amazon.US
Return policy: Eligible for Return, Refund or Replacement
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. Read more
Product Information
Publisher | Cambridge University Press |
Publication date | November 23, 2006 |
Language | English |
Print length | 288 pages |
ISBN-10 | 0521032512 |
ISBN-13 | 978-0521032513 |
Item Weight | 1.03 pounds |
Dimensions | 6.69 x 0.65 x 9.61 inches |
Part of series | Cambridge Tracts in Theoretical Computer Science |
Best Sellers Rank | #8,841,279 in Books (See Top 100 in Books) #358 in Software Design & Engineering #1,084 in Computer Programming Languages #1,515 in Software Development (Books) |