Termination of context-sensitive rewriting by rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 122-133

  Lucas, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Functional programming; Term rewriting; Termination

Indexed keywords

AUTOMATA THEORY;

CONTEXT SENSITIVE; CONTEXT SENSITIVE REWRITING; TERM REWRITING; TERM REWRITING SYSTEMS; TERMINATION;

FUNCTIONAL PROGRAMMING;

EID: 84947736118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_122     Document Type: Conference Paper

References (16)

1. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science 17:279-301, 1982.
2. N. Dershowitz. Termination of rewriting. Journal on Symbolic Computation, 3:69-115, 1987.
3. N. Dershowitz. A Taste of Rewrite Systems. In P.E. Lauer, editor, Proc. of Functional Programming, Concurrency, Simulation and Automated Reasoning, LNCS 693:199-228, Springer-Verlag, Berlin, 1993.
4. N. Dershowitz and C. Hoot. Natural Termination. Theoretical Computer Science 142(2):179-207, 1995.
5. N. Dershowitz and J.P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243-320. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990.
6. D.P. Friedman and D.S. Wise. CONS should not evaluate its arguments. In S. Michaelson and R. Milner, editors, Automata, Languages and Programming, pages 257-284, Edinburgh University Press, 1976.
7. J. Goguen, C. Kirchner and J. Meseguer. Concurrent Term Rewriting as a Model of Computation. In J.H. Fasel, R.M. Keller, editors, Graph Reduction. Proceedings, of a Workshop. LNCS 279:53-93. Springer-Verlag, Berlin, 1987.
8. S. Kamin and J.J. Levy. Two generalizations of the recursive path ordering. University of Illinois, 1980.
9. J.F.Th. Kamperman and H.R. Walters. Lazy Rewriting and Eager Machinery. In J. Hsiang, editor, Proc. of the 6th International Conference on Rewriting Techniques and Applications, RTA'95, LNCS 914:147-162, Springer-Verlag, Berlin, 1995.
10. G. Huet and J.J. Levy. Computations in orthogonal term rewriting systems. In J.L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of J. Alan Robinson. MIT Press, Cambridge, MA, 1991.
11. R. Lalement. Computation as Logic. Masson-Prentice Hall International, 1993.
12. S. Lucas. Computational properties in context-sensitive rewriting. In M. Alpuente and M.I. Sessa, editors, Proc. of 1995 Joint Conference on Declarative Programming, GULP-PRODE'95, pages 435-446, 1995.
13. S. Lucas. Fundamentals of context-sensitive rewriting. In M. Bartösek, J. Staudek and J. Wiedermann, editors, Proc. of XXII Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'95, LNCS 1012:405-412, Springer-Verlag, Berhn, 1995.
14. Z. Manna and S Ness. On the termination of Markov algorithms. In Proc. of the Third Hawaii International Conference on System Science, pages 789-792, 1970.
15. S. L. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, London, 1987.
16. C. Reade. Elements of Functional Programming. Addison-Wesley Publishing Company, 1987.