A type-based termination criterion for dependently-typed higher-order rewrite systems
<|reference_start|>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 beta-reduction in the Calculus of Constructions.<|reference_end|>
@article{blanqui2006a,
    title={A type-based termination criterion for dependently-typed higher-order
  rewrite systems},
    author={Frederic Blanqui (INRIA Lorraine - LORIA)},
    journal={Dans 15th International Conference on Rewriting Techniques and
  Applications - RTA'04 (2004) 15 p},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0610062},
    primaryClass={cs.LO cs.PL}
}