56 search results - page 2 / 12 » A Tool Proving Well-Definedness of Streams Using Termination... |
LISP
2008
13 years 7 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...
RTA
2004
Springer
14 years 21 days ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
IANDC
2007
13 years 7 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
PEPM
2004
ACM
14 years 21 days 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...
RTA
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...