584 search results - page 63 / 117 » Logic Programs as term Rewriting Systems |
AGP
1999
IEEE
15 years 2 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
182
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
CASES
2010
ACM
14 years 7 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
102
click to vote
XPU
2004
Springer
15 years 3 months ago
2004
Springer
We describe how a small, successful, self-selected XP team approached a seemingly intractable problem with panache, flair and immodesty. We rewrote a legacy application by deliver...
105
click to vote
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...