Bit strings and semantics

Randall Holmes (
Wed, 26 Oct 1994 16:52:50 -0600

With a suitable ADT interface, bit strings can be made to look
like objects of the most amazing and diverse sorts!!! (lists
(even infinite ones!), trees, formulas of your favorite language,
arbitrary-precision integers, maybe even ZFC sets :-)

So the argument against the semantic, non-formalist attitude is
belied by C. S. practice. We are not exhorted to remember that objects
of the usual CS types are implemented as bit strings in various odd
ways -- in fact, we are usually supposed to forget this!!!

The opinions expressed | --Sincerely,
above are not the "official" | M. Randall Holmes
opinions of any person | Math. Dept., Boise State Univ.
or institution. |