We define a compilation scheme for a constructor-based strongly-sequential graph rewriting system which shortcuts some needed steps. The result of this compilation is another constructor-based graph rewriting system that is normalizing for the original system when using an innermost strategy. We then modify the resulting rewrite sytem in a way that avoids totally or partially the construction of the contracta of some needed steps of a computation. The resulting rewrite system can be easily implemented by eager functions in a variety of programming languages. When computing normal forms in this way, both memory consumption and execution time are reduced compared to ordinary rewriting computations in the original system
Original language
English
Publication year
2014
Number of pages
5
Publication status
Published - 2014
Event
International Workshop on Computing with Terms and Graphs - Vienna, Austria Duration: 13 Jul 2014 → 13 Jul 2014 Conference number: 8
Workshop
Workshop
International Workshop on Computing with Terms and Graphs