论文信息 - A Gap Between Linear and Non Linear Term-Rewriting Systems (1)

A Gap Between Linear and Non Linear Term-Rewriting Systems (1)

We prove that every recursively enumerable set of terms is generated by a non linear t.r.s in 2 passes. Conversely, every set of terms which is generated by a linear t.r.s in a finite number of passes is recognizable.

Max Dauchet | Francesco De Comité | Francesco De Comité | M. Dauchet

[1] Alfred V. Aho,et al. Currents In The Theory Of Computing , 1973 .

[2] Leslie Paul Chew. Normal forms in term rewriting systems , 1981 .

[3] Mizuhito Ogawa,et al. On the Uniquely Converging Property of Nonlinear Term Rewriting Systems , 1989 .

[4] james w.thatcher,et al. tree automata: an informal survey , 1974 .

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

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

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

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

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

[10] Joost Engelfriet,et al. IO and OI. I , 1977, J. Comput. Syst. Sci..

[11] Deepak Kapur,et al. Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems , 1982, ICALP.

[12] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.

[13] J. Engelfriet,et al. IO and OI , 1975 .

[14] Martin W. Bunder,et al. An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators , 1985, Theor. Comput. Sci..