Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Higher-order rewrite systems and their confluence
Theoretical Computer Science - Special issue: rewriting systems and applications
Term rewriting and all that
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
RTA '95 Proceedings of the 6th 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
Confluence without Termination via Parallel Critical Pairs
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Infinitary Combinatory Reduction Systems
Information and Computation
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Dependency pairs for simply typed term rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We propose simply typed term rewriting systems (STTRSs), which extend first-order rewriting by allowing higher-order functions. We study a simple proof method for confluence which employs a characterization of the diamond property of a parallel reduction. By an application of the proof method, we obtain a new confluence result for orthogonal conditional STTRSs. We also discuss a semantic method for proving termination of STTRSs based on monotone interpretation.