References

  1. S. Antoy (1992): Definitional Trees. In: H. Kirchner & G. Levi: Proceedings of the Third International Conference on Algebraic and Logic Programming. Springer LNCS 632, Volterra, Italy, pp. 143–157. Available at http://dx.doi.org/10.1007/bfb0013825.
  2. S Antoy (1993): Normalization by Leftmost Innermost Rewriting. In: Proceedings of the Third International Workshop on Conditional Term Rewriting Systems. Springer-Verlag, London, UK, pp. 448–457. Available at http://dx.doi.org/10.1007/3-540-56393-8_36.
  3. S. Antoy (2005): Evaluation Strategies for Functional Logic Programming. Journal of Symbolic Computation 40(1), pp. 875–903. Available at http://dx.doi.org/10.1016/j.jsc.2004.12.007.
  4. S. Antoy (2010): Programming with Narrowing. Journal of Symbolic Computation 45(5), pp. 501–522. Available at http://dx.doi.org/10.1016/j.jsc.2010.01.006.
  5. S. Antoy (2011): On the Correctness of Pull-Tabbing. TPLP 11(4-5), pp. 713–730. Available at http://dx.doi.org/10.1017/S1471068411000263.
  6. S. Antoy, D. Brown & S. Chiang (2006): Lazy Context Cloning for Non-deterministic Graph Rewriting. In: Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph'06, Vienna, Austria, pp. 61–70. Available at http://dx.doi.org/10.1016/j.entcs.2006.10.026.
  7. S. Antoy & M. Hanus (2006): Overlapping Rules and Logic Variables in Functional Logic Programs. In: Proceedings of the Twenty Second International Conference on Logic Programming. Springer LNCS 4079, Seattle, WA, pp. 87–101. Available at http://dx.doi.org/10.1007/11799573_9.
  8. S. Antoy & A. Jost (2013): Are needed redexes really needed?. In: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13. ACM, New York, NY, USA, pp. 61–71. Available at http://doi.acm.org/10.1145/2505879.2505881.
  9. M. Bezem, J. W. Klop & R. de Vrijer (eds.) (2003): Term Rewriting Systems. Cambridge University Press. Available at http://dx.doi.org/10.1145/979743.979772.
  10. G. L. Burn, S. L. Peyton Jones & J. D. Robson (1988): The Spineless G-machine. In: Proceedings of the 1988 ACM Conference on LISP and Functional Programming. ACM, pp. 244–258. Available at http://doi.acm.org/10.1145/62678.62717.
  11. R. Echahed & J. C. Janodet (1997): On constructor-based graph rewriting systems. Technical Report 985-I. IMAG. Available at ftp://ftp.imag.fr/pub/labo-LEIBNIZ/OLD-archives/PMP/c-graph-rewriting.ps.gz.
  12. W. Fokkink & J. van de Pol (1997): Simulation as a correct transformation of rewrite systems. In: In Proceedings of 22nd Symposium on Mathematical Foundations of Computer Science, LNCS 1295. Springer, pp. 249–258. Available at http://dx.doi.org/10.1.1.41.8118.
  13. J. C. González Moreno, F. J. López Fraguas, M. T. Hortalá González & M. Rodríguez Artalejo (1999): An Approach to Declarative Programming Based on a Rewriting Logic. The Journal of Logic Programming 40, pp. 47–87. Available at http://dx.doi.org/10.1016/S0743-1066(98)10029-8.
  14. M. Hanus (1994): The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19&20, pp. 583–628. Available at http://dx.doi.org/10.1.1.226.8638‎.
  15. M. Hanus (2013): Functional Logic Programming: From Theory to Curry. In: Programming Logics - Essays in Memory of Harald Ganzinger. Springer LNCS 7797, pp. 123–168. Available at http://dx.doi.org/10.1007/978-3-642-37651-1_6.
  16. M. Hanus, S. Lucas & A. Middeldorp (1998): Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters 67(1), pp. 1–8. Available at http://dx.doi.org/10.1016/S0020-0190(98)00016-7.
  17. M. Hanus (ed.) (2012): Curry: An Integrated Functional Logic Language (Vers. 0.8.3). Available at http://www.curry-language.org.
  18. G. Huet & J.-J. Lévy (1991): Computations in orthogonal term rewriting systems. In: J.-L. Lassez & G. Plotkin: Computational logic: essays in honour of Alan Robinson. MIT Press, Cambridge, MA. Part I, pp. 395–414 and Part II, pp. 415–443.
  19. J. F. T. Kamperman & H. R. Walters (1996): Simulating TRSs by Minimal TRSs a Simple, Efficient, and Correct Compilation Technique. Technical Report CS-R9605. CWI.
  20. R. Kieburtz (1985): The G-machine: A fast, graph-reduction evaluator. In: Functional Programming Languages and Computer Architecture LNCS 201. Springer, pp. 400–413. Available at http://dx.doi.org/10.1007/3-540-15975-4_50.
  21. F. J. López-Fraguas, E. Martin-Martin, J. Rodríguez-Hortalá & J. Sánchez-Hernández (2014): Rewriting and narrowing for constructor systems with call-time choice semantics. TPLP 14(2), pp. 165–213. Available at http://dx.doi.org/10.1017/S1471068412000373.
  22. A. Middeldorp (1997): Call by Need Computations to Root-stable Form. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '97. ACM, New York, NY, USA, pp. 94–105. Available at http://dx.doi.org/10.1145/263699.263711.
  23. M. J. O'Donnell (1977): Computing in Systems Described by Equations. Springer LNCS 58. Available at http://dx.doi.org/10.1007/3-540-08531-9.
  24. Philip Wadler (1988): Deforestation: Transforming Programs to Eliminate Trees. Theor. Comput. Sci. 73(2), pp. 231–248. Available at http://dx.doi.org/10.1016/0304-3975(90)90147-A.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org