Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Term rewriting and all that
Theoretical Computer Science - Special issue on theories of types and proofs
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination and Confluence of Higher-Order Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
On Termination of Higher-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Higher-Order Rewriting and Partial Evaluation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Termination Proofs for Higher-order Rewrite Systems
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Universal algebra for termination of higher-order rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We give a novel transformation method for proving termination of higher-order rewrite rules in Klop's format called Combinatory Reduction System (CRS). The format CRS essentially covers the usual pure higher-order functional programs such as Haskell. Our method called higher-order semantic labelling is an extension of a method known in the theory of term rewriting. This attaches semantics of the arguments to each function symbol. We systematically define the labelling by using the complete algebraic semantics of CRS, Σ-monoids. We also examine the power of higher-order semantic labelling by several examples. This includes an interesting example from the viewpoint of functional programming.