Zoltán Horváth, Viktória Zsók, Peter Achten, Pieter Koopman
1 Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University2 Department of Computer Science, Science and Technology, Aarhus University3 Department of Computer Science, Science and Technology, Aarhus University
We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a third style of graph reduction: a graph evaluator.
Trends in Functional Programming 10: Selected Papers From the Tenth Symposium on Trends in Functional Programming, Tfp 2009, Komárno, Slovakia, 2-4 June 2009, 2010, p. 1-16
Main Research Area:
Symposium on Trends in Functional Programming, TFP, 2010