104 search results - page 15 / 21 » Proving Termination Properties with mu-term |
FC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. At FC'05, Chen et al. introduced an elegant privacy protecting coupon (PPC) system, CESSS05 [13], in which users can purchase multi-coupons and redeem them unlinkabl...
CTRS
1987
13 years 11 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
JAR
2006
13 years 7 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
JACM
2007
13 years 7 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...