On the Normalization and Unique Normalization Properties of Term Rewrite Systems-Reference-Cited by-同舟云学术

On the Normalization and Unique Normalization Properties of Term Rewrite Systems

Published: Issue: Volume: Page:247-262
ISSN:0302-9743
Container-title:Automated Deduction – CADE-21
language:
Short-container-title:

Author:

Godoy Guillem,Tison Sophie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-73595-3_17.pdf

Reference16 articles.

1. Bachmair, L.: Canonical Equational Proofs. Birkhäuser, Boston (1991)

2. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: International Symposium on Theoretical Aspects of Computeter Science, pp. 161–171 (1992)

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on http://www.grappa.univ-lille3.fr/tata

4. Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), pp. 243–320, Amsterdam, North-Holland (1990)

5. Durand, I.: Call by need computations in orthogonal term rewriting systems, 07, Habilitation diriger des recherches de l’université de Bordeaux (2005)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New Undecidability Results for Properties of Term Rewrite Systems;Electronic Notes in Theoretical Computer Science;2012-12

2. Non-Linear Rewrite Closure and Weak Normalization;Journal of Automated Reasoning;2012-09-16

3. Normalization properties for Shallow TRS and Innermost Rewriting;Applicable Algebra in Engineering, Communication and Computing;2009-12-15

4. Undecidable properties of flat term rewrite systems;Applicable Algebra in Engineering, Communication and Computing;2009-04-21

5. Unique Normalization for Shallow TRS;Rewriting Techniques and Applications;2009