A compiler for rewrite programs in associative-commutative theories
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 230-249
- https://doi.org/10.1007/bfb0056617
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Principles of MaudeElectronic Notes in Theoretical Computer Science, 1996
- Fast matching in combinations of regular equational theoriesElectronic Notes in Theoretical Computer Science, 1996
- Associative-commutative matching via bipartite graph matchingThe Computer Journal, 1995
- Tree Automata Help One To Solve Equational Formulae In AC-TheoriesJournal of Symbolic Computation, 1994
- Flatterms, discrimination nets, and fast term rewritingJournal of Automated Reasoning, 1993
- Combining matching algorithms: The regular caseJournal of Symbolic Computation, 1991
- Compilation of pattern matching with associative-commutative functionsPublished by Springer Nature ,1991
- Complexity of matching problemsJournal of Symbolic Computation, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973