A type-based termination criterion for dependently-typed higher-order rewrite systems
Logic in Computer Science
2007-05-23 v1 Programming Languages
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0610062,
title = {A type-based termination criterion for dependently-typed higher-order rewrite systems},
author = {Frederic Blanqui},
journal= {arXiv preprint arXiv:cs/0610062},
year = {2007}
}
Comments
Colloque avec actes et comit\'{e} de lecture. internationale