Termination of Context-Sensitive Rewriting by Rewriting
暂无分享,去创建一个
[1] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .
[2] Nachum Dershowitz,et al. A Taste of Rewrite Systems , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.
[3] Salvador Lucas. Computational Properties in Context-Sensitive Rewriting , 1995, GULP-PRODE.
[4] Salvador Lucas,et al. Fundamentals of Context=Sensitive Rewriting , 1995, SOFSEM.
[5] José Meseguer,et al. Concurrent term rewriting as a model of computation , 1986, Graph Reduction.
[6] René Lalement. Computation as logic , 1993, Prentice Hall International series in computer science.
[7] H. R. Walters,et al. Lazy Rewriting and Eager Machinery , 1995, RTA.
[8] Jan van Leeuwen,et al. Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .
[9] Nachum Dershowitz,et al. Natural Termination , 1995, Theor. Comput. Sci..
[10] Chris Reade,et al. Elements of functional programming , 1989, International computer science series.
[11] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[12] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[13] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.
[14] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).