Errata for “Concepts, Techniques, and Models of Computer Programming” (fourth printing)

This page lists all known errors and their corrections for the most recent (fourth) printing of the book. The errors in the first printing are given here and the errors in the second and third printings are given here. If you find any new errors, please notify one of the authors. We use the following notation for the corrections: positive line numbers start counting from the top of the text body; negative line numbers start counting from the bottom (including footnote text).

The authors wish to thank the following people for their help in finding errors in the book since the first printing: Hassan Aït-Kaci, Stefan Andrei, Cosmin Arad, Shannon Behrens, Christopher Campbell, Raphaël Collet, Arnaud Dagnelies, Olivier Danvy, Juan Francisco Diaz, Isabelle Dony, Robert Godfroid, Jeff Jackson, John Johnson, Kent Johnson, Harish Karnick, Waclaw Kusnierczyk, Irene Langkilde-Geary, Erick Lavoie, Gary T. Leavens, Mark S. Miller, David R. Musser, Konstantin Popov, Chris Rathman, Fred Spiessens, and Tony Tanami Vågenes.

• Page 104, line -6: "(1917-)" should be "(1917-2008)".
• Page 232, line 9: "section 3.4.4" should be "section 3.4.5".
• Page 249, line -12: "Y" should be "Xs".
• Page 249, line -7: "Remark" should be "We remark".
• Page 275, line 4: "has its has its" should be "has its".
• Page 373, figure 5.11: replace both occurrences of "/=" by "\=".
• Page 400, lines 1-2: "{Call Ping ping(0)}" should be "{Call pingobj ping(0)}" and "{Call Pong pong(10000000)}" should be "{Call pongobj pong(10000000)}".
• Page 428, line 3: "{C1 union(C2)}" should be "{C1.union C2}".
• Page 429, line 5: "{C union(D)}" should be "{C.union D}".
• Page 431: The Call by value example is better written as:

   procedure sqr(a:integer);
   begin
      a:=a*a;
   end;
   var c:integer;
   c:=25;
   sqr(c);
   browse(c);  /* value of c unchanged */
  

  with Oz translation:

   proc {Sqr D}
      A={NewCell D}
   in
      A:=@A*@A
   end
   local
      C={NewCell 0}
   in
      C:=25
      {Sqr @C}
      {Browse @C}  /* content of C unchanged */
   end
  

  This gives a more reasonable definition of sqr and shows how to pass variables by value.
• Page 458, line -11: "This" should be "This is".
• Page 471, line -6: "implemented" should be "implemented with".
• Page 472, line -9: "IncWords" should be "IncWord".
• Pages 559-560: The short-circuit protocol can be greatly simplified by relying on the FIFO property of port objects. The methods newsucc and newpred are not needed. The method kill(X S) can be replaced by:

   meth kill(X S)
      if @alive then
         if S==1 then @last=@ident
         elseif X mod @step==0 then
            alive:=false
            {@pred setSucc(@succ)}
            {@succ setPred(@pred)}
            {@succ kill(X+1 S-1)}
         else
            {@succ kill(X+1 S)}
         end
      else {@succ kill(X S)} end
   end
  

  This works because the FIFO property guarantees that the setSucc and setPred messages arrive at their destinations before the kill messages.
• Page 615, line 5: add the phrase "The queue must contain an entry with priority P.".
• Page 752, line -3: "equation" should be "equations".

Back to the book