Results 1 to 10 of about 7,948 (166)
Term Graph Rewriting and Parallel Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj +5 more sources
Complexity of Conditional Term Rewriting [PDF]
Logical Methods in Computer Science, 2017 We propose a notion of complexity for oriented conditional term rewrite systems satisfying certain restrictions. This notion is realistic in the sense that it measures not only successful computations, but also partial computations that result in a ...
Cynthia Kop +2 more
doaj +5 more sources
On the adequacy of graph rewriting for simulating term rewriting [PDF]
ACM Transactions on Programming Languages and Systems, 1994 Several authors have investigated the correspondence between graph rewriting and term rewriting. Almost invariably they have considered only acyclic graphs. Yet cyclic graphs naturally arise from certain optimizations in implementing functional languages.
J W Klop, Andrew W Appel
exaly +3 more sources
Modes of Convergence for Term Graph Rewriting [PDF]
Logical Methods in Computer Science, 2012 Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent.
Patrick Bahr
doaj +1 more source
On probabilistic term rewriting [PDF]
Science of Computer Programming, 2018 We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered.
Martin Avanzini +2 more
openaire +5 more sources
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems.
Ryota Nakayama +2 more
doaj +1 more source
Partial Order Infinitary Term Rewriting [PDF]
Logical Methods in Computer Science, 2014 We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions.
Patrick Bahr
doaj +1 more source
Extending Context-Sensitivity in Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We propose a generalized version of context-sensitivity in term rewriting based on the notion of "forbidden patterns". The basic idea is that a rewrite step should be forbidden if the redex to be contracted has a certain shape and appears in a certain ...
Bernhard Gramlich, Felix Schernhammer
doaj +1 more source
Semantics-Preserving DPO-Based Term Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Term graph rewriting is important as "conceptual implementation" of the execution of functional programs, and of data-flow optimisations in compilers.
Wolfram Kahl, Yuhang Zhao
doaj +1 more source
Faithful (meta-)encodings of programmable strategies into term rewriting systems [PDF]
Logical Methods in Computer Science, 2017 Rewriting is a formalism widely used in computer science and mathematical logic. When using rewriting as a programming or modeling paradigm, the rewrite rules describe the transformations one wants to operate and rewriting strategies are used to con ...
Horatiu Cirstea +2 more
doaj +1 more source