Deduction, Strategies, and Rewriting
Open Access
- 1 July 2007
- journal article
- research article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 174 (11) , 3-25
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Reflective metalogical frameworksACM Transactions on Computational Logic, 2004
- Abstract Congruence ClosureJournal of Automated Reasoning, 2003
- Reflection in conditional rewriting logicTheoretical Computer Science, 2002
- Maude: specification and programming in rewriting logicTheoretical Computer Science, 2002
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICSInternational Journal of Foundations of Computer Science, 2001
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- An algorithm for reasoning about equalityCommunications of the ACM, 1978