Advertisement
Published in:
2004 | OriginalPaper | Chapter
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
Author : Frédéric Blanqui
Published in: Rewriting Techniques and Applications
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.