Term graph rewriting

1. M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 4(1): 375–416, 1991.

   Google Scholar 

2. Z.M. Ariola and J.W. Klop. Cyclic lambda graph rewriting. In Proc. Ninth Symposium on Logic in Computer Science (LICS '94), Paris, France, pages 416–425, 1994.

   Google Scholar 

3. Z.M. Ariola and J.W. Klop. Equational Term Graph Rewriting. To appear in Fundamenta Informaticae, 1996.

   Google Scholar 

4. Z.M. Ariola and J.W. Klop. Lambda calculus with explicit recursion. To appear as Report CS-R96xx, CWI Amsterdam, 1996.

   Google Scholar 

5. E. Barendsen. Types and Computations in Lambda Calculi and Graph Rewrite Systems. PhD thesis, University of Nijmegen, 1995.

   Google Scholar 

6. S.C.C. Blom. A Complete Proof System for Nested Term Graphs. In this proceedings.

   Google Scholar 

7. E. Barendsen and J.E.W. Smetsers. Conventional and uniqueness typing in graph rewrite systems. Technical Report CSI-R9328, Computing Science Institute, University of Nijmegen, 1993.

   Google Scholar 

8. B. Courcelle, G. Kahn and J. Vuillemin. Algorithmes d'équivalence et de réduction à des expressions minimales dans une classe d'équations récursives simples. In J. Loeckx, editor, Proc. 2nd Colloquium on Automata, Languages and Programming (ICALP '74), University of Saarbrucken, Springer-Verlag LNCS 14, pages 200–213, 1974.

   Google Scholar 

9. J.R. Kennaway, J.W. Klop, M.R. Sleep and F.J. de Vries. The adequacy of term graph rewriting for simulating term rewriting. Transactions on Programming Languages and Systems, 16(3): 493–523, 1994.

   Google Scholar 

10. J.R. Kennaway, J.W. Klop, M.R. Sleep and F.J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 119(1):18–38, 1995.

    Google Scholar 

11. J.R. Kennaway, J.W. Klop, M.R. Sleep and F.J. de Vries. Infinitary lambda calculus. To appear in Theoretical Computer Science, 1996.

    Google Scholar 

12. K.H. Rose. Explicit cyclic substitutions. In M. Rusinowitch and J.L. Rémy, editors, Proc. 3rd International Workshop on Conditional Term Rewriting Systems (CTRS '92), Pont-à-Mousson, France, Springer-Verlag LNCS 656, pages 36–50, 1992.

    Google Scholar 

13. J.E.W. Smetsers. Graph Rewriting and Functional Languages. PhD thesis, University of Nijmegen, 1993.

    Google Scholar 

14. M.R. Sleep, M.J. Plasmeijer and M.C.D.J. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley & Sons, 1993.

    Google Scholar 

15. T. Schmidt and T. Ströhlein. Relations and Graphs. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993.

    Google Scholar 

16. C. Wadsworth. Semantics and Pragmatics of the Lambda-Calculus. PhD thesis, University of Oxford, 1971.

    Google Scholar 

Download references