Results 41 to 50 of about 12,133 (300)
Lifting Term Rewriting Derivations in Constructor Systems by Using Generators [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an ...
Adrián Riesco, Juan Rodríguez-Hortalá
doaj +1 more source
Termination of linear bounded term rewriting systems [PDF]
, 2010 For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting.
Sylvestre, Marc +2 more
core +1 more source
A rewriting point of view on strategies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper is an expository contribution reporting on published work. It focusses on an approach followed in the rewriting community to formalize the concept of strategy.
Hélène Kirchner
doaj +1 more source
A faithful encoding of programmable strategies into term rewriting systems [PDF]
, 2015 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 declarative rewriting strategies are used
Moreau, Pierre-Etienne +2 more
core +1 more source
Towards 3-Dimensional Rewriting Theory [PDF]
Logical Methods in Computer Science, 2014 String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer.
Samuel Mimram
doaj +1 more source
Structure and Properties of Traces for Functional Programs [PDF]
, 2007 The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support program comprehension and debugging.
Luo, Yong +3 more
core +1 more source
, 1987 Graph rewriting (also called reduction) as defined in Wadsworth [1971] was introduced in order to be able to give a more efficient implementation of functional programming languages in the form of lambda calculus or term rewrite systems: identical subterms are shared using pointers.
Barendregt, H.P. +5 more
openaire +1 more source
Confluence of nearly orthogonal infinitary term rewriting systems [PDF]
, 2015 We give a relatively simple coinductive proof of confluence, modulo equivalence of root-active terms, of nearly orthogonal infinitary term rewriting systems. Nearly orthogonal systems allow certain root overlaps, but no non-root overlaps.
Czajka, Lukasz
core +1 more source
Modes of Convergence for Term Graph Rewriting [PDF]
, 2011 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.
Bahr, Patrick; id_orcid +2 more
core +1 more source
Meaningless terms in rewriting
, 1996 Summary: We present an axiomatic approach to the concept of meaninglessness in finite and transfinite term rewriting and lambda calculus We justify our axioms in several ways. They can be intuitively justified from the viewpoint of rewriting as computation.
Richard Kennaway +2 more
openaire +6 more sources