6 Observations
6.1 Suitability of I-code for optimisation
6.2 Performance
6.3 Cost of optimisation
6.3.1 Compile time
6.3.2 Space requirement
6.3.3 Logical complexity
6.4 Comments on the results
6.4.1 Register remembering
6.4.2 Remembering environments
6.4.4 Array allocation and use
6.4.5 Parameters in registers
6.4.6 Condition-code remembering 6.11.7 Merging
6.5 Criticisms and benefits of the technique
6.5.1 Complexity
6.5.2 I/O overhead
6.5.3 Lack of gains
6.5.4 Flexibility
6.6 Comments on Instruction sets and Optimisation
7 Conclusions
7.1 Viability of the technique
7.2 Ease of portability
7.3 Nature of optimisations

Appendix

A1  Simplified I-code definition
A2  I-code internal representation
A3  Results References