Graph-Reducible Term Rewriting Systems
暂无分享,去创建一个
[1] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Annegret Habel,et al. Jungle evaluation , 1988, Fundam. Informaticae.
[3] Michael J. O'Donnell,et al. Computing in systems described by equations , 1977, Lecture Notes in Computer Science.
[4] Yoshihito Toyama,et al. Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..
[5] Berthold Hoffmann,et al. Jungle Evaluation for Efficient Term Rewriting , 1988, ALP.
[6] Marko C. J. D. van Eekelen,et al. Term Graph Rewriting , 1987, PARLE.
[7] Detlef Plump,et al. Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems , 1990, CTRS.
[8] Jan Willem Klop,et al. TERM REWRITING SYSTEMS FROM , 2005 .
[9] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[10] Pierre Lescanne,et al. Algebraic and Logic Programming , 1988, Lecture Notes in Computer Science.
[11] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .