99 search results - page 16 / 20 » Automated termination proofs for haskell by term rewriting |
RTA
2007
Springer
14 years 1 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...