A Template Based Graph Reduction System Based on Combinators
AbstractGraph reduction is one of the important evaluation strategy for lazy functional Programming. A combinator is a function that contains no free variables. The idea is based on the fact that, all of the variables in a program can be removed by transforming it into a sequence of combinators which would be drawn from a small pre-defined (fixed) set of combinators (SKI), or which would be drawn from an unlimited number of non-pre- defined set of dynamic super-combinators (SC). We are suggesting a template based algorithm which reduces the stored graph structure of the super-combinators. We can define any produced super-combinators by using templates and use them to perform reduction on the graph. The template based algorithrn could be extended and any produced super-combinators can be defined with a predefined template list. The test results show that our approach increases the efficiency of super-combinators algorithms.
Share & Cite This Article
Çavuşoğlu, A.; Göktaş, H.H.; Vardal, N. A Template Based Graph Reduction System Based on Combinators. Math. Comput. Appl. 2002, 7, 253-262.
Çavuşoğlu A, Göktaş HH, Vardal N. A Template Based Graph Reduction System Based on Combinators. Mathematical and Computational Applications. 2002; 7(3):253-262.Chicago/Turabian Style
Çavuşoğlu, Abdullah; Göktaş, H. H.; Vardal, Necla. 2002. "A Template Based Graph Reduction System Based on Combinators." Math. Comput. Appl. 7, no. 3: 253-262.