882 search results - page 156 / 177 » A Taste of Rewrite Systems |
EUROGP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. A protein is a linear chain of amino acids that folds into a unique functional structure, called its native state. In this state, proteins show repeated substructures lik...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
IJCNLP
2005
Springer
14 years 2 months ago
2005
Springer
This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text...
LCPC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRAL overcome this issue by empirically s...
CADE
2004
Springer
14 years 2 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...