## A Discipline of ProgrammingExecutional abstraction; The role of programming languages; States and their characterization; The characterization of semantics; The semantic characterization of a programming language; Two theorems; On the design of properly terminating; Euclid's algorithm revisited; The formal treatment of some small examples; The linear search theorem; The problem of the next permutation. |

### What people are saying - Write a review

#### LibraryThing Review

User Review - MarkvanderPol - LibraryThingOne of the grandfathers of computer science. Lucid exploration of fundamental programming constructs that are still the daily tools of legions of programmers worldwide. If only they had the concept grounding from this book (or those like it) myriads of bugs would never be written. Read full review

#### LibraryThing Review

User Review - mykl-s - LibraryThing-helped make me a good programmer -It 's about simplicity and clarity and about designing first, then writing -not an easy read, but well worth it Read full review

### Contents

PROGRAMMING LANGUAGE | 24 |

CONSTRUCTS | 41 |

Q THE FORMAL TREATMENT OF SOME SMALL | 51 |

Copyright | |

9 other sections not shown

### Other editions - View all

### Common terms and phrases

active scope ALGOL 60 algorithm allsix alternative construct aq.high argument array variable assignment statement ax.dom ax.hib ax.lob begin glocon boolean bucket C.A.R. Hoare Cartesian product chapter ckey clockwise boundary colour computation context convex hull current hull decrease defined definition denote divisor domain Dutch national flag element empty End of note End of remark established Euclid's algorithm execution finite formal function GCD(x given greatest common divisor guaranteed implies initializing statement inner block inspected integer introduce invariant relation kfac Linear Search machine maximal strong component mechanism newfile nondeterminacy oldfile operation pebble possible post-condition predicate transformer privar problem programming language repetitive construct semantics separation of concerns sequence set(i shortest solution statement list subset termination theorem tion true ultraviolet branches vertex vertices violet branch vir int array virvar weakest pre-condition wp(DO wp(IF wp(S x.key x.norm xnext y.key

### References to this book

Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan No preview available - 2004 |

Model Driven Architecture: Applying MDA to Enterprise Computing David Frankel No preview available - 2003 |