Results 11 to 20 of about 12,133 (300)
, 2021 We present a way to implement term rewriting on a GPU. We do this by letting the GPU repeatedly perform a massively parallel evaluation of all subterms. We find that if the term rewrite systems exhibit sufficient internal parallelism, GPU rewriting substantially outperforms the CPU.
Johri van Eerd +4 more
core +8 more sources
Electronic Notes in Theoretical Computer Science, 1998 AbstractTerm rewriting has a large potential for industrial applications, but these applications are always larger than one could ever dream of: huge sets of rewrite rules and gigantic terms to rewrite pose interesting challenges for implementors and theoreticians alike.
Mark van den Brand +2 more
openaire +3 more sources
, 1998 Rational terms (possibly infinite terms with finitely many subterms) can be represented in a finite way via Μ-terms, that is, terms over a signature extended with self-instantiation operators. For example, f w = f(f(f(...))) can be represented as Μx.f(x) (or also as Μ x .f(f(x)), f(Μx.f(x)), ...).
CORRADINI, ANDREA, GADDUCCI, FABIO
openaire +2 more sources
, 2006 21 pages; 22nd International Conference on Logic Programming (ICLP'06)
Gregory J. Duck +2 more
openaire +3 more sources
Implementing conditional term rewriting by graph rewriting
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enno Ohlebusch, Ohlebusch, Enno
openaire +3 more sources
Reversible Term Rewriting. [PDF]
, 2016 Essentially, in a reversible programming language, for each forward computation step from state S to state S', there exists a constructive and deterministic method to go backwards from state S' to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata ...
Naoki Nishida 0001 +2 more
openaire +4 more sources
Bisimilarity in Term Graph Rewriting
Information and Computation, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ariola, Z.M., Klop, J.W., Plump, D.
openaire +4 more sources
Modularity of Convergence and Strong Convergence in Infinitary Rewriting [PDF]
Logical Methods in Computer Science, 2010 Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures.
Stefan Michael Kahrs
doaj +1 more source
Confluence of Conditional Term Rewrite Systems via Transformations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 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 ...
Karl Gmeiner
doaj +1 more source
A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods [PDF]
Logical Methods in Computer Science, 2022 It is well-known that some equational theories such as groups or boolean algebras can be defined by fewer equational axioms than the original axioms. However, it is not easy to determine if a given set of axioms is the smallest or not.
Mirai Ikebuchi
doaj +1 more source