- Logic assertion U:T.
- Tree U is well typed with type T.
- Static typing for language.
- Type attributes can be calculated without evaluating the program.
- Strongly typed language.
- No run-time incompatibility errors.
- Unicity of typing.
- Can a syntax tree be typed in multiple ways?
- Soundness of typing rules.
- Are the typing rules sensible in their assignment of type attributes to
Questions will be addressed later.
Author: Wolfgang Schreiner
Last Modification: March 26, 1998