M. Ayala-Rincón
M. Fernández
M. J. Gabbay
A. C. Rocha Oliveira
2015
Checking Overlaps of Nominal Rewriting Rules
Pre-proc. LSFA
199–2014
https://www.mat.ufrn.br/~LSFA2015/preproceedings.pdf
M. Ayala-Rincón
M. Fernández
A. C. Rocha Oliveira
2015
Completeness in PVS of a Nominal Unification Algorithm
Pre-proc. LSFA
19–34
https://www.mat.ufrn.br/~LSFA2015/preproceedings.pdf
F. Baader
T. Nipkow
1998
Term Rewriting and All That
Cambridge University Press
10.1017/CBO9781139172752
M. Bezem
J.W. Klop
R. de Vrijer
2003
Term Rewriting Systems by TeReSe
Cambridge Tracts in Theoretical Computer Science
55
Cambridge University Press
A. L. Galdino
M. Ayala-Rincón
2008
A Formalization of Newman's and Yokouchi Lemmas in a Higher-Order Language
Journal of Formalized Reasoning
1
1
39–50
10.6092/issn.1972-5787/1347
A. L. Galdino
M. Ayala-Rincón
2010
A Formalization of the Knuth-Bendix(-Huet) Critical Pair Theorem
J. of Automated Reasoning
45
3
301–325
10.1007/s10817-010-9165-2
G. Huet
1981
A complete proof of correctness of the Knuth-Bendix completion algorithm
Journal of Computer and Systems Sciences
23
1
11–21
10.1016/0022-0000(81)90002-7
D. E. Knuth
P. B. Bendix
1970
Computational Problems in Abstract Algebra
Simple Words Problems in Universal Algebras
263–297
J. Leech, ed. Pergamon Press, Oxford, U. K.
10.1016/B978-0-08-012975-4.50028-X
M. H. A. Newman
1942
On theories with a combinatorial definition of ``equivalence''
Ann. of Math.
43(2)
223–243
10.2307/1968867
A. C. Rocha Oliveira
M. Ayala-Rincón
2013
Formalizing the Confluence of Orthogonal Rewriting Systems
CoRR
abs/1303.7335
10.4204/EPTCS.113.14
http://arxiv.org/abs/1303.7335
B. K. Rosen
1973
Tree-Manipulating Systems and Church-Rosser Theorems
J. of the ACM
20
1
160–187
10.1145/321738.321750