References

  1. Beatriz Alarcón, Raúl Gutiérrez & Salvador Lucas (2010): Context-sensitive dependency pairs. Inf. Comput. 208(8), pp. 922–968, doi:10.1016/j.ic.2010.03.003.
  2. Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas & Rafael Navarro-Marset (2010): Proving Termination Properties with mu-term. In: Michael Johnson & Dusko Pavlovic: Algebraic Methodology and Software Technology - 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers, Lecture Notes in Computer Science 6486. Springer, pp. 201–208, doi:10.1007/978-3-642-17796-5_12.
  3. Sergio Antoy (1992): Definitional Trees. In: Hélène Kirchner & Giorgio Levi: Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings, Lecture Notes in Computer Science 632. Springer, pp. 143–157, doi:10.1007/BFb0013825.
  4. Franz Baader & Tobias Nipkow (1998): Term rewriting and all that. Cambridge University Press.
  5. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer & Carolyn L. Talcott (2007): All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. Lecture Notes in Computer Science 4350. Springer, doi:10.1007/978-3-540-71999-1.
  6. Nachum Dershowitz, Stéphane Kaplan & David A. Plaisted (1991): Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . .. Theor. Comput. Sci. 83(1), pp. 71–96, doi:10.1016/0304-3975(91)90040-9.
  7. Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara & Jan Willem Klop (2010): Productivity of stream definitions. Theor. Comput. Sci. 411(4-5), pp. 765–782, doi:10.1016/j.tcs.2009.10.014.
  8. Jörg Endrullis & Dimitri Hendriks (2011): Lazy productivity via termination. Theor. Comput. Sci. 412(28), pp. 3203–3225, doi:10.1016/j.tcs.2011.03.024.
  9. Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud & José Meseguer (1985): Principles of OBJ2. In: Mary S. Van Deusen, Zvi Galil & Brian K. Reid: Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, USA, January 1985. ACM Press, pp. 52–66, doi:10.1145/318593.318610.
  10. Kokichi Futatsugi & Ataru T. Nakagawa (1997): An Overview of CAFE Specification Environment - An Algebraic Approach for Creating, Verifying, and Maintaining Formal Specifications over Networks. In: ICFEM, pp. 170, doi:10.1109/ICFEM.1997.630424.
  11. Jürgen Giesl, Peter Schneider-Kamp & René Thiemann (2006): Automatic Termination Proofs in the Dependency Pair Framework. In: Ulrich Furbach & Natarajan Shankar: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, Lecture Notes in Computer Science 4130. Springer, pp. 281–286, doi:10.1007/11814771_24.
  12. Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi & Jean-Pierre Jouannaud (2000): Introducing OBJ. In: Software Engineering with OBJ: Algebraic Specification in Action. Kluwer, pp. 3–167, doi:10.1007/978-1-4757-6541-0.
  13. Joe Hendrix & José Meseguer (2007): On the Completeness of Context-Sensitive Order-Sorted Specifications. In: Franz Baader: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, Lecture Notes in Computer Science 4533. Springer, pp. 229–245, doi:10.1007/978-3-540-73449-9_18.
  14. Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph H. Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Richard B. Kieburtz, Rishiyur S. Nikhil, Will Partain & John Peterson (1992): Report on the Programming Language Haskell, A Non-strict, Purely Functional Language. SIGPLAN Notices 27(5), pp. 1, doi:10.1145/130697.130699.
  15. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep & Fer-Jan de Vries (1995): Transfinite Reductions in Orthogonal Term Rewriting Systems. Inf. Comput. 119(1), pp. 18–38, doi:10.1006/inco.1995.1075.
  16. Salvador Lucas (1995): Fundamentals of Context=Sensitive Rewriting. In: Miroslav Bartosek, Jan Staudek & JiríWiedermann: SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23 - December 1, 1995, Proceedings, Lecture Notes in Computer Science 1012. Springer, pp. 405–412, doi:10.1007/3-540-60609-2_25.
  17. Salvador Lucas (1996): Context-Sensitive Computations in Confluent Programs. In: Herbert Kuchen & S. Doaitse Swierstra: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, Lecture Notes in Computer Science 1140. Springer, pp. 408–422, doi:10.1007/3-540-61756-6_100.
  18. Salvador Lucas (1997): Needed Reductions with Context-Sensitive Rewriting. In: Michael Hanus, Jan Heering & Karl Meinke: Algebraic and Logic Programming, 6th International Joint Conference, ALP '97 - HOA '97, Southampton, U.K., Spetember 3-5, 1997, Proceedings, Lecture Notes in Computer Science 1298. Springer, pp. 129–143, doi:10.1007/BFb0027007.
  19. Salvador Lucas (1997): Transformations for Efficient Evaluations in Functional Programming. In: Hugh Glaser, Pieter H. Hartel & Herbert Kuchen: Programming Languages: Implementations, Logics, and Programs, 9th International Symposium, PLILP'97, Including a Special Trach on Declarative Programming Languages in Education, Southampton, UK, September 3-5, 1997, Proceedings, Lecture Notes in Computer Science 1292. Springer, pp. 127–141, doi:10.1007/BFb0033841.
  20. Salvador Lucas (1998): Context-sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming 1998(1).
  21. Salvador Lucas (2002): Context-Sensitive Rewriting Strategies. Inf. Comput. 178(1), pp. 294–343, doi:10.1006/inco.2002.3176.
  22. Salvador Lucas (2015): Completeness of context-sensitive rewriting. Inf. Process. Lett. 115(2), pp. 87–92, doi:10.1016/j.ipl.2014.07.004.
  23. Aart Middeldorp (1997): Call by Need Computations to Root-Stable Form. In: Peter Lee, Fritz Henglein & Neil D. Jones: Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15-17 January 1997. ACM Press, pp. 94–105, doi:10.1145/263699.263711.
  24. Masaki Nakamura, Kazuhiro Ogata & Kokichi Futatsugi (2010): Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications. J. Symb. Comput. 45(5), pp. 551–573, doi:10.1016/j.jsc.2010.01.008.
  25. Enno Ohlebusch (2002): Advanced topics in term rewriting. Springer, doi:10.1007/978-1-4757-3661-8.
  26. Matthias Raffelsieper (2011): Productivity of Non-Orthogonal Term Rewrite Systems. In: Santiago Escobar: Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2011, Novi Sad, Serbia, 29 May 2011., EPTCS 82, pp. 53–67, doi:10.4204/EPTCS.82.4.
  27. Ben A. Sijtsma (1989): On the Productivity of Recursive List Definitions. ACM Trans. Program. Lang. Syst. 11(4), pp. 633–649, doi:10.1145/69558.69563.
  28. editor TeReSe (2003): Term Rewriting Systems. Cambridge University Press.
  29. Hans Zantema & Matthias Raffelsieper (2009): Stream Productivity by Outermost Termination. In: Maribel Fernández: Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2009, Brasilia, Brazil, 28th June 2009., EPTCS 15, pp. 83–95, doi:10.4204/EPTCS.15.7.
  30. Hans Zantema & Matthias Raffelsieper (2010): Proving Productivity in Infinite Data Structures. In: Christopher Lynch: Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA 2010, July 11-13, 2010, Edinburgh, Scottland, UK, LIPIcs 6. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 401–416, doi:10.4230/LIPIcs.RTA.2010.401.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org