Author:
Durán Francisco,Meseguer José
Subject
Computational Theory and Mathematics,Logic,Theoretical Computer Science,Software
Reference60 articles.
1. On using ground joinable equations in equational theorem proving;Avenhaus;J. Symbolic Comput.,2003
2. On conditional rewrite systems with extra variables and deterministic logic programs;Avenhaus,1994
3. Term Rewriting and All That;Baader,1998
4. Completion for rewriting modulo a congruence;Bachmair;Theoret. Comput. Sci.,1989
5. L. Bachmair, N. Dershowitz, D.A. Plaisted, Completion without failure, in: A.H. Kaci, M. Nivat (Eds.), Resolution of Equations in Algebraic Structures, vol. 2, Academic Press, 1989, pp. 1–30 (Rewriting Techniques).
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maude2Lean: Theorem proving for Maude specifications using Lean;Journal of Logical and Algebraic Methods in Programming;2025-01
2. Local confluence of conditional and generalized term rewriting systems;Journal of Logical and Algebraic Methods in Programming;2024-01
3. The Maude strategy language;Journal of Logical and Algebraic Methods in Programming;2023-08
4. Building Correct-by-Construction Systems with Formal Patterns;Recent Trends in Algebraic Development Techniques;2023
5. Associative unification in Maude;Journal of Logical and Algebraic Methods in Programming;2022-04