0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Programs, Recursion and Unbounded Choice (Hardcover) Loot Price: R1,265 Discovery Miles 12 650

This item is a special order that could take a long time to obtain.

Programs, Recursion and Unbounded Choice (Hardcover): Wim H. Hesselink
Programs, Recursion and Unbounded Choice (Hardcover): Wim H. Hesselink

Share your images

Programs, Recursion and Unbounded Choice (Hardcover)

Wim H. Hesselink

Series: Cambridge Tracts in Theoretical Computer Science, 27

 (sign in to rate)
Loot Price R1,265 Discovery Miles 12 650

Bookmark and Share

Our supplier does not have stock of this product at present, but we can create a special order for you. Alternatively, if you add it to your wishlist we will send you an email message should it become available from stock. Special orders from this supplier are normally fulfilled within 31 - 41 working days. Please note:

  • Special order items cannot be combined on an order with other items.
  • Special orders can sometimes take significantly longer than this estimate and sometimes our suppliers may be unable to fill a special order.
  • We cannot accept returns of special order titles.
  • If we haven't been able to get the product for you within about 3 months, we will automatically cancel the order and fully refund any payments that you have made.

New to special orders? Find out more.

This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs.

General

Imprint: Cambridge UniversityPress
Country of origin: United Kingdom
Series: Cambridge Tracts in Theoretical Computer Science, 27
Release date: May 1992
First published: 1992
Authors: Wim H. Hesselink
Dimensions: 247 x 174 x 16mm (L x W x T)
Format: Hardcover
Pages: 235
ISBN-13: 978-0-521-40436-5
Barcode: 9780521404365
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Promotions
LSN: 0-521-40436-3

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Loyalty partners