GRAPH REDUCTION WITH SUPER−COMBINATORS

Abstract

This paper explains the principles of graph reduction and develops a new graph reduction method based on surper-combinatiors. An optimality criterion for the new method is derived and a simple method of generation optimal code presented. The results of an experimental comparison are reported, showing the super-combinator method to be more efficient than previous ones.