A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems

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 types, hence providing a powerful termination criterion for the combination of rewriting and β-reduction in the Calculus of Constructions.

• Type: Conference
• Year: 2004
• Where: RTA
• Authors: Frédéric Blanqui
• Keywords: Non-structural Recursive Calls, Powerful Termination Criterion, RTA 2004, Theoretical Computer Science, Type-based Termination Criteria