References

1. Philip Bille & Inge Li Gørtz (2011): The tree inclusion problem: In linear space and faster. ACM Trans. Algorithms 7(3), pp. 38:1–38:47, doi:10.1145/1978782.1978793.
2. Nachum Dershowitz (1979): Orderings for term-rewriting systems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Washington, DC, USA, pp. 123–131, doi:10.1109/SFCS.1979.32. Available at http://dl.acm.org/citation.cfm?id=1398508.1382612.
3. Joseph B. Kruskal (1960): Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society 95, pp. 210 – 225, doi:10.2307/1993287.
4. Michael Leuschel (1998): On the Power of Homeomorphic Embedding for Online Termination. In: Static Analysis. Proceedings of SAS'98, LNCS 1503. Springer-Verlag, pp. 230–245, doi:10.1007/3-540-49727-7_14.
5. Michael Leuschel (2002): Homeomorphic embedding for online termination of symbolic methods. In: The essence of computation, LNCS 2566. Springer-Verlag, pp. 379–403, doi:10.1007/3-540-36377-7_17.
6. Neil Mitchell (2010): Rethinking supercompilation. In: Proceedings of ICFP'2010, the 15th ACM SIGPLAN international conference on Functional programming, SIGPLAN Notices 45(9). ACM, New York, NY, USA, pp. 309–320, doi:10.1145/1863543.1863588.
7. Dave Schmidt (Sampled May 2013): Homepage. http://people.cis.ksu.edu/~ schmidt/. Available at http://people.cis.ksu.edu/~schmidt/.
8. Morten H. Sørensen & Robert Glück (1995): An Algorithm of Generalization in Positive Supercompilation. In: Proceedings of ILPS'95, the International Logic Programming Symposium. MIT Press, pp. 465–479, doi:10.1.1.49.1869.
9. Ian Wehrman (2006): Higman's Theorem and the Multiset Order. http://www.cs.utexas.edu/~ iwehrman/pub/ms-wqo.pdf. Available at http://www.cs.utexas.edu/~iwehrman/pub/ms-wqo.pdf.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org