325 search results - page 14 / 65 » Rewriting Strategies in Java |
PLILP
1993
Springer
15 years 1 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
93
Voted
CCL
1994
Springer
15 years 1 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
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...