Fr. 97.20

Programs, Recursion and Unbounded Choice

English · Paperback / Softback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

Zusammenfassung A complete account of the predicate transformation calculus semantics of sequential programs. Inhaltsverzeichnis 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.

Product details

Authors Wim H. Hesselink, Hesselink Wim H.
Assisted by C. J. van Rijsbergen (Editor), C. J. van Rijsbergen (Editor)
Publisher Cambridge University Press ELT
 
Languages English
Product format Paperback / Softback
Released 22.08.2005
 
EAN 9780521018296
ISBN 978-0-521-01829-6
No. of pages 240
Series Cambridge Tracts in Theoretica
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.