500 search results - page 44 / 100 » ACD Term Rewriting |
111
click to vote
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
PADL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
A visual query is based on pictorial representation of conceptual entities and operations. One of the most important features used in visual queries is the shape. Despite its intu...
JAR
2006
14 years 9 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
ENTCS
2007
14 years 9 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...