Forskning ved Københavns Universitet - Københavns Universitet

Forside

Higher-order (non-)modularity

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Dokumenter

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.
OriginalsprogEngelsk
TitelProceedings of the 21st International Conference on Rewriting Techniques and Applications
RedaktørerChristopher Lynch
Antal sider16
ForlagSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publikationsdato2010
Sider17-32
ISBN (Elektronisk)978-3-939897-18-7
DOI
StatusUdgivet - 2010
Begivenhed21st International Conference on Rewriting Techniques and Applications - Edinburgh, Storbritannien
Varighed: 11 jul. 201013 jul. 2010

Konference

Konference21st International Conference on Rewriting Techniques and Applications
LandStorbritannien
ByEdinburgh
Periode11/07/201013/07/2010
NavnLeibniz International Proceedings in Informatics
Vol/bind6
ISSN1868-8969

Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk


Ingen data tilgængelig

ID: 32193311