234 search results - page 26 / 47 » Deduction, Strategies, and Rewriting |
ENTCS
2007
13 years 7 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
ENTCS
2008
13 years 7 months ago
2008
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
ENTCS
2007
13 years 7 months ago
2007
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing redu...
SARA
2009
Springer
14 years 5 days ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
ENTCS
2007
13 years 7 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...