We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also inter-derive a graph evaluator.
Tenth Symposium on Trends in Functional Programming, Tfp. Proceedings, 2009, p. 164-178
Main Research Area:
Symposium on Trends in Functional Programming, TFP, 2009