Forskning ved Københavns Universitet - Københavns Universitet

Forside

Higher-order (non-)modularity

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

Standard

Higher-order (non-)modularity. / Appel, Claus; van Oostrom, Vincent; Simonsen, Jakob Grue.

Proceedings of the 21st International Conference on Rewriting Techniques and Applications. red. / Christopher Lynch. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. s. 17-32 (Leibniz International Proceedings in Informatics, Bind 6).

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

Harvard

Appel, C, van Oostrom, V & Simonsen, JG 2010, Higher-order (non-)modularity. i C Lynch (red.), Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, bind 6, s. 17-32, 21st International Conference on Rewriting Techniques and Applications, Edinburgh, Storbritannien, 11/07/2010. https://doi.org/10.4230/LIPIcs.RTA.2010.17

APA

Appel, C., van Oostrom, V., & Simonsen, J. G. (2010). Higher-order (non-)modularity. I C. Lynch (red.), Proceedings of the 21st International Conference on Rewriting Techniques and Applications (s. 17-32). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics, Bind. 6 https://doi.org/10.4230/LIPIcs.RTA.2010.17

Vancouver

Appel C, van Oostrom V, Simonsen JG. Higher-order (non-)modularity. I Lynch C, red., Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2010. s. 17-32. (Leibniz International Proceedings in Informatics, Bind 6). https://doi.org/10.4230/LIPIcs.RTA.2010.17

Author

Appel, Claus ; van Oostrom, Vincent ; Simonsen, Jakob Grue. / Higher-order (non-)modularity. Proceedings of the 21st International Conference on Rewriting Techniques and Applications. red. / Christopher Lynch. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. s. 17-32 (Leibniz International Proceedings in Informatics, Bind 6).

Bibtex

@inproceedings{30e5b58544c444e0bf6318a669db2743,
title = "Higher-order (non-)modularity",
abstract = "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.",
author = "Claus Appel and {van Oostrom}, Vincent and Simonsen, {Jakob Grue}",
year = "2010",
doi = "10.4230/LIPIcs.RTA.2010.17",
language = "English",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "17--32",
editor = "Christopher Lynch",
booktitle = "Proceedings of the 21st International Conference on Rewriting Techniques and Applications",
note = "null ; Conference date: 11-07-2010 Through 13-07-2010",

}

RIS

TY - GEN

T1 - Higher-order (non-)modularity

AU - Appel, Claus

AU - van Oostrom, Vincent

AU - Simonsen, Jakob Grue

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

U2 - 10.4230/LIPIcs.RTA.2010.17

DO - 10.4230/LIPIcs.RTA.2010.17

M3 - Article in proceedings

T3 - Leibniz International Proceedings in Informatics

SP - 17

EP - 32

BT - Proceedings of the 21st International Conference on Rewriting Techniques and Applications

A2 - Lynch, Christopher

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Y2 - 11 July 2010 through 13 July 2010

ER -

ID: 32193311