Programs, Recursion and Unbounded Choice Image close
Programs, Recursion and Unbounded Choice by Wim H. Hesselink
Programs, Recursion and Unbounded Choice by Wim H. Hesselink
Show Hide Adult Content
Programs, Recursion and Unbounded Choice close

Computers & Internet Books:

Home  
Books  
Computers & Internet  
Theory & Design  
Mathematical theory of computation

Programs, Recursion and Unbounded Choice

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$126.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley

Buy Now, Pay Later with:

4 payments of $31.75 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

Explore more Cambridge Tracts in Theoretical Computer Science

See all products in this series

Modal Logic by Patrick Blackburn
$259.99
Modal Logic
by Patrick Blackburn ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Action Semantics by Peter D. Mosses
$156.99
Action Semantics
by Peter D. Mosses ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Predicate Transformer Semantics by Ernest G. Manes
$150.99
Predicate Transformer Semantics
by Ernest G. Manes ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Formal Specification and Design by L.M.G. Feijs
$142.99
Formal Specification and Design
by L.M.G. Feijs ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Two-Level Functional Languages on Hardback by Flemming Nielson
$339.99
Two-Level Functional Languages
by Flemming Nielson ~ Hardback
Available - Usually ships in 3-4 weeks
Algebraic Specification of Communication Protocols
$127.99
Algebraic Specification of Communication Protocols
Paperback / softback
Available - Usually ships in 3-4 weeks
A Unifying Framework for Structured Analysis and Design Models by T.H. Tse
$101.99
A Unifying Framework for Structured Analysis and Design Models
by T.H. Tse ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Lambda-calculus, Combinators and Functional Programming by G. E. Revesz
$143.99
Lambda-calculus, Combinators and Functional Programming
by G. E. Revesz ~ Paperback / softback
Available - Usually ships in 3-4 weeks
The Logic of Typed Feature Structures by Robert L. Carpenter
$127.99
The Logic of Typed Feature Structures
by Robert L. Carpenter ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Domains and Lambda-Calculi on Hardback by Roberto M. Amadio
$376.99
Domains and Lambda-Calculi
by Roberto M. Amadio ~ Hardback
Available - Usually ships in 3-4 weeks
Term Rewriting Systems on Hardback by Terese
$504.99
Term Rewriting Systems
by Terese ~ Hardback
Available - Usually ships in 3-4 weeks
The Clausal Theory of Types on Hardback by D.A. Wolfram
$182.99
The Clausal Theory of Types
by D.A. Wolfram ~ Hardback
Available - Usually ships in 3-4 weeks
Derivation and Computation on Hardback by H. Simmons
$352.99
Derivation and Computation
by H. Simmons ~ Hardback
Available - Usually ships in 3-4 weeks
The Uncertain Reasoner's Companion by J.B. Paris
$132.99
The Uncertain Reasoner's Companion
by J.B. Paris ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Applications of Process Algebra
$248.99
Applications of Process Algebra
Paperback / softback
Available - Usually ships in 3-4 weeks
Two-Level Functional Languages by Flemming Nielson
$141.99
Two-Level Functional Languages
by Flemming Nielson ~ Paperback / softback
Available - Usually ships in 3-4 weeks

Description

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.
Release date Australia
August 22nd, 2005
Audience
  • Professional & Vocational
Illustrations
Worked examples or Exercises
Pages
240
Dimensions
170x245x12
ISBN-13
9780521018296
Product ID
1968969

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Computers & Internet >
Theory & Design >
Mathematical theory of computation
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation