Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2019.12
URN: urn:nbn:de:0030-drops-105193
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10519/
Czajka, Lukasz ; Kop, Cynthia
Polymorphic Higher-Order Termination
| pdf-format: |
|
Abstract
We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F_omega. This enables a direct interpretation of rewrite rules which make essential use of impredicative polymorphism. In addition, our generalisation eases the applicability of the method in the non-polymorphic setting by allowing for the encoding of inductive data types. As an illustration of the potential of our method, we prove termination of a substantial fragment of full intuitionistic second-order propositional logic with permutative conversions.
BibTeX - Entry
@InProceedings{czajka_et_al:LIPIcs:2019:10519,
author = {Lukasz Czajka and Cynthia Kop},
title = {{Polymorphic Higher-Order Termination}},
booktitle = {4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-107-8},
ISSN = {1868-8969},
year = {2019},
volume = {131},
editor = {Herman Geuvers},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10519},
URN = {urn:nbn:de:0030-drops-105193},
doi = {10.4230/LIPIcs.FSCD.2019.12},
annote = {Keywords: termination, polymorphism, higher-order rewriting, permutative conversions}
}
| Keywords: | termination, polymorphism, higher-order rewriting, permutative conversions | |
| Seminar: | 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 18.06.2019 |
