Programs, Recursion and Unbounded Choice

(Part of the Cambridge Tracts in Theoretical Computer Science Series)

by Wim H. Hesselink

No Customer Reviews

Select Format

Select Condition

Book Overview

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...

Format:Paperback

Language:English

ISBN:0521018293

ISBN13:9780521018296

Release Date:August 2005

Publisher:Cambridge University Press

Length:240 Pages

Weight:0.86 lbs.

Dimensions:0.5" x 6.7" x 9.6"

Related Subjects

Computer Science Computers Computers & Technology Education & Reference Foreign Language Study & Reference Languages & Tools Mathematics Programming Science & Math Software Design, Testing & Engineering

Customer Reviews

0 rating

Write a review

ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.

Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks^® and the ThriftBooks^® logo are registered trademarks of Thrift Books Global, LLC

Programs, Recursion and Unbounded Choice

(Part of the Cambridge Tracts in Theoretical Computer Science Series)

Select Format

Select Condition

Recommended

Book Overview

Customer Reviews

Popular Categories

Website

My Account

Partnerships

Quick Help

About Us

Follow Us