License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TLCA.2015.257
URN: urn:nbn:de:0030-drops-51684
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5168/
Jouannaud, Jean-Pierre ;
Li, Jianqi
Termination of Dependently Typed Rewrite Rules
Abstract
Our interest is in automated termination proofs of higher-order rewrite rules in presence of dependent types modulo a theory T on base types. We first describe an original transformation to a type discipline without type dependencies which preserves non-termination. Since the user must reason on expressions of the transformed language, we then introduce an extension of the computability path ordering CPO for comparing dependently typed expressions named DCPO. Using the previous result, we show that DCPO is a well-founded order, behaving well in practice.
BibTeX - Entry
@InProceedings{jouannaud_et_al:LIPIcs:2015:5168,
author = {Jean-Pierre Jouannaud and Jianqi Li},
title = {{Termination of Dependently Typed Rewrite Rules}},
booktitle = {13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)},
pages = {257--272},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-87-3},
ISSN = {1868-8969},
year = {2015},
volume = {38},
editor = {Thorsten Altenkirch},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5168},
URN = {urn:nbn:de:0030-drops-51684},
doi = {10.4230/LIPIcs.TLCA.2015.257},
annote = {Keywords: rewriting, dependent types, strong normalization, path orderings}
}
|
Keywords: |
|
rewriting, dependent types, strong normalization, path orderings |
|
Collection: |
|
13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
15.06.2015 |
