Rewriting Via Coinserters
نویسندگان
چکیده
This paper introduces a semantics for rewriting that is independent of the data being rewritten and which, nevertheless, models key concepts such as substitution which are central to rewriting algorithms. We demonstrate the naturalness of this construction by showing how it mirrors the usual treatment of algebraic theories as coequalizers of monads. We also demonstrate its naturalness by showing how it captures several canonical forms of rewriting. ACM CCS
منابع مشابه
On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation∗
This paper improves the existing criterion for proving confluence of a normal conditional term rewriting system (CTRS) via the Şerbănuţă-Roşu transformation, a computationally equivalent transformation of CTRSs into unconditional term rewriting systems (TRS), showing that a weakly left-linear normal CTRS is confluent if the transformed TRS is confluent. Then, we discuss usefulness of the optimi...
متن کاملAxiomatic Sharing-via-Labelling
A judicious use of labelled terms makes it possible to bring together the simplicity of term rewriting and the sharing power of graph rewriting: this has been known for twenty years in the particular case of orthogonal first-order systems. The present paper introduces a concise and easily usable axiomatic presentation of sharing-via-labelling techniques that applies to higher-order term rewriti...
متن کاملRational Term Rewriting
Rational terms (possibly innnite terms with nitely many subterms) can be represented in a nite way via-terms, that is, terms over a signature extended with self-instantiation operators. For example, f ! = f(f(f(: : :))) can be represented as x:f(x) (or also as x:f(f(x)), f(x:f(x)),. . .). Now, if we reduce a-term t to s via a rewriting rule using standard notions of the theory of Term Rewriting...
متن کاملConfluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملPositive Fragments of Coalgebraic Logics
Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nord. J. Comput.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003