Higher-order (non-)modularity
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- Appel_2010_Highter-order
Final published version, 173 KB, PDF document
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the higher-order rewriting format. We show that for the particular format of simply typed applicative term rewriting systems modularity of confluence, normalization, and termination can be recovered by imposing suitable linearity constraints.
Original language | English |
---|---|
Title of host publication | Proceedings of the 21st International Conference on Rewriting Techniques and Applications |
Editors | Christopher Lynch |
Number of pages | 16 |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publication date | 2010 |
Pages | 17-32 |
ISBN (Electronic) | 978-3-939897-18-7 |
DOIs | |
Publication status | Published - 2010 |
Event | 21st International Conference on Rewriting Techniques and Applications - Edinburgh, United Kingdom Duration: 11 Jul 2010 → 13 Jul 2010 |
Conference
Conference | 21st International Conference on Rewriting Techniques and Applications |
---|---|
Land | United Kingdom |
By | Edinburgh |
Periode | 11/07/2010 → 13/07/2010 |
Series | Leibniz International Proceedings in Informatics |
---|---|
Volume | 6 |
ISSN | 1868-8969 |
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 32193311