417 search results - page 13 / 84 » Orderings for Innermost Termination |
SPLST
2003
13 years 8 months ago
2003
We integrate user-defined functions with semantic equations into standard Prolog. In order to interface them with Prolog, we introduce a single operator. If a predicate invocation...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwar...
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...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...