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

### From inside the book

Try this search over all volumes: **ckey**

Results 1-0 of 0

### What people are saying - Write a 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

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

### Contents

O EXECUTIONAL ABSTRACTION l | 1 |

THE ROLE OF PROGRAMMING LANGUAGES | 7 |

ON NONDETERMINACY BEING BOUNDED | 9 |

Copyright | |

18 other sections not shown

### Other editions - View all

### Common terms and phrases

abort abs(x ALGOL 60 allsix alternative construct argument array variable assignment statement ax.dom ax.hib ax.lob begin glocon boolean C.A.R. Hoare Cartesian product chapter ckey clockwise boundary computation concurrent assignment convex hull decrease defined definition denote domain Dutch national flag edges element empty End of note established Euclid's algorithm execution expression face final state satisfying finite formal function GCD(x given glovar greatest common divisor guaranteed guarded command set guards is true implies initial state satisfying inner block inspected integer introduce invariant relation kfac Linear Search machine maximal strong component mechanism operation pebble possible post-condition predicate transformer privar problem programming language q.high repetitive construct separation of concerns sequence solution space statement list subset syntactic category termination theorem tion ultraviolet branches vertex vertices violet branch vir int array virvar weakest pre-condition wlp(S wp(DO wp(IF wp(S wp(SL 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 |