Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!sun-barr!newstop!exodus!red-dwarf!pallas
From: pallas@eng.sun.com (Joseph Pallas)
Newsgroups: comp.object
Subject: Re: Documenting OO Systems
Message-ID: <pallas.670282952@red-dwarf>
Date: 29 Mar 91 21:42:32 GMT
References: <9103070342.AA07462@.nextserver.cs.stthomas.edu.cs.stthomas.edu ..> <1114@tetrauk.UUCP> <271@orbit.gtephx.UUCP> <jls.669588928@rutabaga> <20106@alice.att.com> <jls.670044262@rutabaga> <20131@alice.att.com>
Sender: news@exodus.Eng.Sun.COM
Lines: 21

In <20131@alice.att.com> ark@alice.att.com (Andrew Koenig) writes:

>If English were intrinsically unambiguous,
>there would be no poetry.  But I don't want
>formal descriptions of algorithms to be poetic,
>thank you.

I can't resist dredging these up from "Mathematical Writing":

"I'm thinking about running a contest for the best Pascal program that
is also a sonnet."
				--Don Knuth

This algorithm to count bits
Rotates VALUE one left and sums its
    two's-comp negation
    in a zeroed location
Repeats WORD LENGTH times, then exits.

				--anonymous
joe