118 search results - page 6 / 24 » An Account of Implementing Applicative Term Rewriting |
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The design and development of an Interactive Evolutionary Computation (IEC) system needs to take into account the implementation issues found when delivering the system to “Real...