99 search results - page 15 / 20 » Automated termination proofs for haskell by term rewriting |
TPHOL
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrit...
ICLP
2005
Springer
14 years 27 days ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
POPL
2005
ACM
14 years 7 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...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
DAGSTUHL
2007
13 years 8 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...