References

1. F. Baader & T. Nipkow (1998): Term Rewriting and All That. Cambridge University Press. Available at http://dx.doi.org/10.2277/0521779200.
2. J. Endrullis (2010): Termination and Productivity. Vrije Universiteit Amsterdam. Available at http://hdl.handle.net/1871/15879.
3. J. Endrullis, C. Grabmayer & D. Hendriks (2008): Data-oblivious Stream Productivity. In: Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08), Lecture Notes in Computer Science 5330. Springer-Verlag, pp. 79–96. Available at http://dx.doi.org/10.1007/978-3-540-89439-1_6. Web interface tool: http://infinity.few.vu.nl/productivity/.
4. J. Endrullis, C. Grabmayer & D. Hendriks (2009): Complexity of Fractran and Productivity. In: Proceedings of the 22nd Conference on Automated Deduction (CADE'09), Lecture Notes in Computer Science 5663. Springer-Verlag, pp. 371–387. Available at http://dx.doi.org/10.1007/978-3-642-02959-2_28.
5. J. Endrullis & D. Hendriks (2011): Lazy Productivity via Termination. Theoretical Computer Science 412(28), pp. 3203–3225. Available at http://dx.doi.org/10.1016/j.tcs.2011.03.024.
6. J. Giesl, P. Schneider-Kamp & R. Thiemann (2006): AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In: Proceedings of the 3rd International Joint Conference on Automatic Reasoning (IJCAR'06), Lecture Notes in Computer Science 4130. Springer-Verlag, pp. 281–286. Available at http://dx.doi.org/10.1007/11814771_24. Web interface tool: http://aprove.informatik.rwth-aachen.de.
7. S. Lucas (1998): Context-sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming 1998(1). Available at http://mitpress.mit.edu/e-journals/JFLP/articles/1998/A98-01/A98-01.html.
8. S. Lucas (2002): Context-Sensitive Rewrite Strategies. Information and Computation 178(1), pp. 294–343. Available at http://dx.doi.org/10.1006/inco.2002.3176.
9. Nangate Inc. (2008): Open Cell Library v2008_10 SP1. Available at http://www.nangate.com/openlibrary/.
10. S. Peyton Jones (2003): Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press. Available at http://www.haskell.org/definition.
11. Terese (2003): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55. Cambridge University Press, Cambridge, UK. Available at http://dx.doi.org/10.2277/0521391156.
12. H. Zantema (2008): Normalization of Infinite Terms. In: Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA'08), Lecture Notes in Computer Science 5117. Springer-Verlag, pp. 441–455. Available at http://dx.doi.org/10.1007/978-3-540-70590-1_30.
13. H. Zantema (2009): Well-definedness of Streams by Termination. In: Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), Lecture Notes in Computer Science 5595. Springer-Verlag, pp. 164–178. Available at http://dx.doi.org/10.1007/978-3-642-02348-4_12.
14. H. Zantema & M. Raffelsieper (2010): Proving Productivity in Infinite Data Structures. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA'10), Leibniz International Proceedings in Informatics (LIPIcs) 6. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, pp. 401–416. Available at http://dx.doi.org/10.4230/LIPIcs.RTA.2010.401.
15. H. Zantema & M. Raffelsieper (2010): Stream Productivity by Outermost Termination. In: Proceedings of the 9th International Workshop in Reduction Strategies in Rewriting and Programming (WRS'09), Electronic Proceedings in Theoretical Computer Science 15. Available at http://dx.doi.org/10.4204/EPTCS.15.7.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org