|
Section 6.5.2:
|
![]() |
A Type graph is the structure which is used to determine type correctness for a complete compiled program. Either of the sets defined may, of course, be empty. The specification below does not require more than one check of the graph during well-formedness testing for a complete program.
|
Specification Index |
|
Language Index |
|
Section 6 Index |
| Comments
or enquiries should be made to Keith Hopper. Page last modified: Wednesday, 25 October 2000. |
|