1385 search results - page 75 / 277 » Natural Rewriting for General Term Rewriting Systems |
143
click to vote
APAL
2010
15 years 6 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
150
click to vote
XSYM
2004
Springer
15 years 11 months ago
2004
Springer
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relatio...
139
click to vote
CIDR
2009
15 years 7 months ago
2009
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
149
click to vote
LCPC
2005
Springer
15 years 11 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...
161
click to vote
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
We propose and explore a formal approach for black-box testing asynchronously communicating components in open environments. Asynchronicity poses a challenge for validating and tes...