Skip to main content
Conference ProceedingsOPEN ACCESS

Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1577 98-114
DOI: 10.1007/978-3-540-49020-3_7
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We transpose a conservative extension theorem from structural operational semantics to conditional term rewriting. The result is useful for the development of software renovation factories, and for modular specification of abstract data types.

Cite

CITATION STYLE

APA

Fokkink, W., & Verhoef, C. (1999). Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1577, pp. 98–114). Springer Verlag. https://doi.org/10.1007/978-3-540-49020-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free