113 search results - page 10 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
102
click to vote
FLOPS
2008
Springer
15 years 1 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
ICASSP
2010
IEEE
15 years 16 days ago
2010
IEEE
A major challenge faced by a spoken term detection (STD) system is the detection of out-of-vocabulary (OOV) terms. Although a subword-based STD system is able to detect OOV terms,...
121
click to vote
ESSLLI
2009
Springer
14 years 10 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
ICS
2001
Tsinghua U.
15 years 4 months ago
2001
Tsinghua U.
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
132
click to vote
ENTCS
2007
15 years 9 days 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...