Standardization theorem revisited

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

Volumn 1139, Issue , 1996, Pages 122-134

  Suzuki, Taro ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL MECHANICS; COMPUTER CIRCUITS; FORMAL LOGIC; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

CONDITIONAL REWRITE SYSTEMS; CONDITIONAL TERM REWRITING SYSTEMS; EXTRA VARIABLES; REWRITE RULES; RIGHT-HAND SIDES; STANDARDIZATION THEOREM; TERM REWRITING SYSTEMS; TRANSFORMATIONAL APPROACH;

STANDARDIZATION;

EID: 84958774193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_8     Document Type: Conference Paper

References (11)

1. J.A. Bergstra and J.W. Klop. Conditional rewrite rules. Journal of Computer and System Sciences, 32:323-362, 1986.
2. G. Boudol. Computational semantics of terms rewriting systems. Technical report, Rapport de recherche INRIA, Feb. 1983.
3. D. Clark and K. Kennaway. Some properties of non-orthogonal term graph rewriting. Electronic Notes in Theoretical Computer Science, 2, 1995.
4. H.B. Curry and R. Feys. Combinatory Logic. voL 1. North-Holaad, 1958.
5. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, VoL B, pages 243-320. North-Holland, 1990.
6. G. Huet and J.-J. LSvy. Computations in orthogonal rewriting systems, I. In J.-L. Lassez and G. Plotkin, editors, Computational Logic, Essays in Honor of Alan Robinson, chapter 11, pages 395-414. The MIT Press, 1991.
7. J.W. Klop. Combinatory Reduction System. PhD thesis, POjksuniversiteit Utrecht, 1980.
8. J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, VoL 2, pages 1-116. Oxford University Press, 1992.
9. P.-A. Melliès. Description abtraite des sysédms de réécriture. PhD thesis, Universit& Paris 7, 1996.
10. A. Middeldorp and E. Itamoen. Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:3-21, 1994.
11. V. van Oostrom. Higher-order families. In International Conference on Rewritin 9 Techniques and Application ‘96, Lecture Notes in Computer Science, 1996. To Appear.