8 search results - page 1 / 2 » A Compiler for Rewrite Programs in Associative-Commutative T... |
PLILP
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
BIRTHDAY
2007
Springer
13 years 11 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
ICLP
1995
Springer
13 years 8 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
PLDI
2011
ACM
12 years 7 months ago
2011
ACM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
CADE
2011
Springer
12 years 4 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...