Sather Home Page

Section 6.5.2:
The Type Graph

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.

6.5.2.1 Abstract Syntax

Type_Graph ::
      subtypes : set of Type_Specifier
      supertypes : set of Type_Specifier ;

6.5.2.2 Despatching


Specification Index Language Index Section 6 Index
Comments or enquiries should be made to Keith Hopper.
Page last modified: Thursday, 26 April 2001.
Produced with Amaya