Dependency pairs are a key concept at the core of modern automated termination provers for first-order term rewriting systems. In this paper, we introduce an extension of this technique for a large class of dependently-typed higher-order rewriting systems. This extends previous resultsby Wahlstedt o...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!