Higher-order (non-)modularity
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Appel_2010_Highter-order
Forlagets udgivne version, 173 KB, PDF-dokument
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.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 21st International Conference on Rewriting Techniques and Applications |
Redaktører | Christopher Lynch |
Antal sider | 16 |
Forlag | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publikationsdato | 2010 |
Sider | 17-32 |
ISBN (Elektronisk) | 978-3-939897-18-7 |
DOI | |
Status | Udgivet - 2010 |
Begivenhed | 21st International Conference on Rewriting Techniques and Applications - Edinburgh, Storbritannien Varighed: 11 jul. 2010 → 13 jul. 2010 |
Konference
Konference | 21st International Conference on Rewriting Techniques and Applications |
---|---|
Land | Storbritannien |
By | Edinburgh |
Periode | 11/07/2010 → 13/07/2010 |
Navn | Leibniz International Proceedings in Informatics |
---|---|
Vol/bind | 6 |
ISSN | 1868-8969 |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 32193311