Small stuff

haskell98-bugs.html

@@ -308,6 +308,9 @@ Right at the bottom of the page, replace "However, for IO, the fail
 method invokes error." by "For IO, the fail method raises a user
 exception in the IO monad (see Section 7.3)."
 
+<p><li> [Aug 2001] <strong>Page 82, Section 6.4, Numbers.</strong>In paragraph 2 of 6.4, replace "Rational library"
+with "Ratio library".
+
 <p><li> [July 2001] <strong>Page 83, Section 6.4.2, Arithmetic and number-theoretic operations.</strong>
 After "The quod, rem, div, and mod class methods satisfy these laws" add "if <tt>y</tt> is non-zero".
 

libraries/directory.verb

@@ -67,7 +67,7 @@ file may not be in use by other processes).
 {\em Error reporting}:
 the @removeDirectory@ and @removeFile@ computations may fail with:
 @isPermissionError@ if the user is not permitted to remove the file/directory;
-or @isDoesNot@-@ExistError@ if the file/directory does not exist.
+or @isDoesNotExistError@ if the file/directory does not exist.
 
 Computation @renameDirectory@~"old"~"new" changes the name of an existing
 directory from "old" to "new"\index{renaming directories}\index{moving
@@ -111,9 +111,9 @@ calling process to "dir"\index{changing the directory}\index{setting the directo
 
 {\em Error reporting}:
 the @setCurrentDirectory@ computation may fail with:
-@isPermission@-@Error@ if the user is not permitted to change directory
+@isPermissionError@ if the user is not permitted to change directory
 to that specified;
-or @isDoesNotExist@-@Error@ if the directory does not exist.
+or @isDoesNotExistError@ if the directory does not exist.
 
 The @Permissions@ type is used to record whether certain operations are
 permissible on a file/directory.  @getPermissions@ and
@@ -144,7 +144,7 @@ clock time at which the file/directory was last modified.
 {\em Error reporting}:
 the @get(set)Permissions@,
 @doesFile(Directory)Exist@,
-and @getMod@-@ificationTime@
+and @getModificationTime@
 computations may fail with:
 @isPermissionError@ if the user is not permitted to access
 the appropriate information;

libraries/index.html

@@ -56,7 +56,7 @@ Ralf Hinze</a>, University of Bonn <br>
 Paul Hudak</a>, Yale University <br>
 <a href="http://www.cs.chalmers.se/~johnsson">
 Thomas Johnsson</a>, Chalmers University of Technology <br>
-<a href="http://www.cs.nott.ac.uk/Department/Staff/mpj/index.html">
+<a href="http://www.cse.ogi.edu/~mpj">
 Mark Jones</a>, Oregon Graduate Institute <br>
 <a href="http://www.cse.ogi.edu/~jl">
 John Launchbury</a>, Oregon Graduate Institute <br>
@@ -84,7 +84,7 @@ version is clearly presented as such, and that it does not claim to be
 a definition of the language Haskell 98.</em>
 <p>
 The master version of the Haskell Library Report is at <a
-href="http://haskell.org/library"> haskell.org</a>.  Any corrections or
+href="http://haskell.org/definition"> haskell.org</a>.  Any corrections or
 changes in the report are found there.
 
 </body>

libraries/introduction.verb

@@ -36,6 +36,7 @@ Sigbjorn Finne,
 Andy Gill, 
 Mike Gunter,
 Fergus Henderson,
+Ørjan Johansen,
 Kent Karlsson,
 Sandra Loosemore,
 Graeme Moss,

libraries/random.verb

@@ -46,9 +46,6 @@ The class @RandomGen@ provides a common interface to random number generators.
 \item The @genRange@ operation yields the range of values returned by
 the generator. 
 
-\item The @next@ operation returns an @Int@ that is uniformly distributed
-in the range returned by @genRange@ (including both end points), and a new
-generator.
 It is required that:
 \begin{itemize}
 \item If $(a,b) ~=~ @genRange@~ g$, then $a \leq b$.
@@ -61,6 +58,10 @@ a single call to @genRange@ to establish a generator's range, without
 being concerned that the generator returned by (say) @next@ might have a different
 range to the generator passed to @next@.
 
+\item The @next@ operation returns an @Int@ that is uniformly distributed
+in the range returned by @genRange@ (including both end points), and a new
+generator.
+
 \item The @split@ operation allows one to obtain two independent random number
 generators.  This is very useful in functional programs (for example, when
 passing a random number generator down to recursive calls), but very little work

report/basic.verb

 %
-% $Header: /home/cvs/root/haskell-report/report/basic.verb,v 1.6 2001/08/14 07:48:24 simonpj Exp $
+% $Header: /home/cvs/root/haskell-report/report/basic.verb,v 1.7 2001/08/14 15:38:33 simonpj Exp $
 %
 %**<title>The Haskell 98 Report: Basic Types and Classes</title>
 %*section 6
@@ -617,7 +617,7 @@ integers (@Int@), arbitrary precision integers (@Integer@), single
 precision floating (@Float@), and double precision floating
 (@Double@).  Other numeric types such as rationals and complex numbers
 are defined in libraries.  In particular, the type @Rational@ is a
-ratio of two @Integer@ values, as defined in the @Rational@
+ratio of two @Integer@ values, as defined in the @Ratio@
 library.  
 
 The default floating point operations defined by the \Haskell{}

report/index.html

@@ -51,7 +51,7 @@ Ralf Hinze</a>, University of Bonn <br>
 Paul Hudak</a>, Yale University <br>
 <a href="http://www.cs.chalmers.se/~johnsson">
 Thomas Johnsson</a>, Chalmers University of Technology <br>
-<a href="http://www.cs.nott.ac.uk/Department/Staff/mpj/index.html">
+<a href="http://www.cse.ogi.edu/~mpj">
 Mark Jones</a>, Oregon Graduate Institute <br>
 <a href="http://www.cse.ogi.edu/~jl">
 John Launchbury</a>, Oregon Graduate Institute <br>
@@ -79,7 +79,7 @@ a definition of the language Haskell 98.</em>
 <p>
 
 The master version of the Haskell Report is at <a
-href="http://haskell.org/report"> haskell.org</a>.  Any corrections or
+href="http://haskell.org/definition"> haskell.org</a>.  Any corrections or
 changes in the report are found there.
 
 

report/preface-13.verb

 %
-% $Header: /home/cvs/root/haskell-report/report/preface-13.verb,v 1.3 2001/08/14 07:48:25 simonpj Exp $
+% $Header: /home/cvs/root/haskell-report/report/preface-13.verb,v 1.4 2001/08/14 15:38:33 simonpj Exp $
 %
 %**<title>The Haskell 98 Report: Preface</title>
 %*section
@@ -275,6 +275,7 @@ Randy Hudson,
 Alexander Jacobson,
 Patrick Jansson,
 Robert Jeschofnik,
+Ørjan Johansen,
 Simon B.~Jones, 
 Stef Joosten, 
 Mike Joy,