CS 342 Lecture -*-Outline-*- * CLU programming students should read section 6.4 for another example ** example problems: counter, subrange of integer cell sets of ints, bitmap display, notes get students to do this on the board. ** techniques: type analysis, reasoning by datatype induction thinking abstractly (abstraction by specification) liskov & guttag diagrams (do this for vocal outline) problem statement techniques: type analysis, specification what do the abstract values look like? liksov and guttag diagrams implementation techniques: use of rep invariant, abstraction function problem checking techniques: type checking, induction ** example of working out a problem program arrays that are more like real CLU problem def: what do the abstract values look like? lb + sequence of elements what operations? want to grow and shrink: addh, remh specify them How to implement? look for the objects: sequence of elements, dope vec. how to check the solution: how to improve the solution for efficiency: reimplement sequence...