Go up to
Go forward to
Static and Strong Typing
From Untyped to Typed Universes
Only one type for all objects:
Bit strings in computer memory,
S-expressions in pure LISP,
-expressions in the
Sets in set theory.
Organization of objects:
Classification of usage/behavior,
Type distinction still shallow:
Easy to violate type distinctions:
Boolean or of character and machine operation?
Last Modification: May 27, 1998