18 search results - page 1 / 4 » Quasi-terminating logic programs for ensuring the terminatio... |
PEPM
2007
ACM
13 years 11 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
ICFP
2005
ACM
13 years 10 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
LISP
2008
13 years 4 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
PEPM
2004
ACM
13 years 10 months ago
2004
ACM
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...