Go up to Top
Go forward to Static and Strong Typing
From Untyped to Typed Universes
- Untyped universes.
- Only one type for all objects:
- Bit strings in computer memory,
- S-expressions in pure LISP,
- lambda-expressions in the lambda-calculus,
- Sets in set theory.
- Organization of objects:
- Classification of usage/behavior,
- Characters, integers,
- Lists, pairs,
- Functions, programs.
- Type distinction still shallow:
- Easy to violate type distinctions:
- Boolean or of character and machine operation?
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: understand.tex,v 1.1 1996/06/12 09:38:21 schreine Exp schreine