Extended Term Rewriting Systems

In this paper we will consider some extensions of the usual term rewrite format, namely: term rewriting with conditions, infinitary term rewriting and term rewriting with bound variables. Rather than aiming at a complete survey, we discuss some aspects of these three extensions.

[1]  C. Böhm,et al.  λ-Calculus and Computer Science Theory , 1975, Lecture Notes in Computer Science.

[2]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[3]  Jan Willem Klop,et al.  Unique Normal Forms for Lambda Calculus with Surjective Pairing , 1989, Inf. Comput..

[4]  Corrado Moiso,et al.  A Complete Semantic Characterization of K-Leaf: A Logic Language with Partial Functions , 1987, SLP.

[5]  Nachum Dershowitz,et al.  Logic Programming cum Applicative Programming , 1985, SLP.

[6]  Nachum Dershowitz,et al.  Equational programming , 1988 .

[7]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .

[8]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[9]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[10]  William M. Farmer,et al.  Redex Capturing in Term Graph Rewriting , 1990, Int. J. Found. Comput. Sci..

[11]  Joyce L. Vedral,et al.  Functional Programming Languages and Computer Architecture , 1989, Lecture Notes in Computer Science.

[12]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[13]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[15]  V. Breazu-Tannen,et al.  Combining algebra and higher-order types , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[16]  Stéphane Kaplan,et al.  Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence , 1987, J. Symb. Comput..

[17]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[18]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[19]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[20]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[21]  A. Church.  The calculi of lambda-conversion , 1941 .

[22]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[23]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[24]  Paul Chew.  Unique normal forms in term rewriting systems with repeated variables , 1981, STOC '81.

[25]  Nachum Dershowitz,et al.  Confluence of Conditional Rewrite Systems , 1988, CTRS.

[26]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract) , 1991, RTA.

[27]  Nachum Dershowitz,et al.  Infinite Normal Forms (Preliminary Version) , 1989, ICALP.

[28]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[29]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[30]  Jean-Pierre Jouannaud,et al.  Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

[31]  Hendrik Pieter Barendregt,et al.  Functional Programming and Lambda Calculus , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[32]  Michael J. O'Donnell,et al.  Equational Logic as a Programming Language , 1985, Logic of Programs.

[33]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[34]  Michael J. O'Donnell,et al.  Computing in systems described by equations , 1977, Lecture Notes in Computer Science.

[35]  Nachum Dershowitz,et al.  A Rationale for Conditional Equational Programming , 1990, Theor. Comput. Sci..

[36]  Nachum Dershowitz,et al.  Canonical Conditional Rewrite Systems , 1988, CADE.

[37]  Jan Willem Klop,et al.  Term rewriting systems: a tutorial , 1987 .

[38]  HuetGérard.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .

[39]  Aart Middeldorp.  Confluence of the Disjoint Union of Conditional Term Rewriting Systems , 1990, CTRS.

[40]  H. Barendregt.  Pairing without conventional restraints , 1974 .

[41]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[42]  Stéphane Kaplan.  Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

[43]  Nachum Dershowitz,et al.  Rewrite, rewrite, rewrite, rewrite, rewrite... , 1989, POPL '89.

[44]  Roel C. de Vrijer,et al.  Extending the Lambda Calculus with Surjective Pairing is Conservative , 1989, LICS.