Programs, Recursion and Unbounded Choice

Programs, Recursion and Unbounded Choice


Choose Expedited Shipping at checkout for guaranteed delivery by Thursday, April 25

Product Details

ISBN-13: 9780521018296
Publisher: Cambridge University Press
Publication date: 05/31/2005
Series: Cambridge Tracts in Theoretical Computer Science Series , #27
Pages: 240
Product dimensions: 6.85(w) x 9.72(h) x 0.51(d)

Table of Contents

List of symbols; Introduction; 1. Weakest preconditions; 2. Annotation, recursion and repetition; 3. Healthiness laws; 4. Semantics of recursion; 5. Ramifications; 6. Relational semantics; 7. Determinacy and disjunctivity; 8. Syntactic criteria; 9. Operational semantics of recursion; 10. Procedure substitutions; 11. Induction and semantic equality; 12. Induction and refinement; 13. The strong preorder; 14. Temporal operators; 15. Predicative fairness; 16. Solutions of exercises; References; Index of concepts and identifiers.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews