68 search results - page 7 / 14 » Automating Termination Proofs for CHR |
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
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 ...
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...
LICS
1995
IEEE
13 years 11 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
CSL
2001
Springer
14 years 10 days 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...