A Functional Homage to Graph Reduction
Graph reduction is an important implementation technique for modern functional programming languages and has up to now only been explained in an inherently imperative way. In this paper we give a functional account of graph reduction. The description is based on the notion of functional graphs, and using the implementation of functional graphs provided by the Functional Graph Library we obtain a (prototypical) implementation of a functional graph reducer.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten