15 search results - page 1 / 3 » Termination and Confluence of Higher-Order Rewrite Systems |
RTA
2000
Springer
15 years 1 months ago
2000
Springer
124
Voted
FROCOS
2011
Springer
13 years 10 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
85
Voted
RTA
2004
Springer
15 years 3 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
91
Voted
RTA
2010
Springer
15 years 2 months ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...
68
Voted
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...