2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/117521Several 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 beta-reduction in the Calculus of Constructions.Colloque avec actes et comité de lecture. internationaleLogic in Computer ScienceProgramming Languagestext