A Semantic Approach to Order-sorted Rewr
✍
A. Werner
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 863 KB
Order-sorted rewriting builds a nice framework to handle partially defined functions and subtypes. To be able to prove a critical-pair lemma and Birkhoff's completeness theorem, order-sorted rewriting was restricted to sort decreasing term rewriting systems. However, natural examples show that this