Results 51 to 60 of about 12,133 (300)
Transforming Outermost into Context-Sensitive Rewriting [PDF]
Logical Methods in Computer Science, 2010 We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system.
Joerg Endrullis, Dimitri Hendriks
doaj +1 more source
Compilation of combinatory reduction systems [PDF]
, 1993 Combinatory Reduction Systems generalise Term Rewriting Systems. They are powerful enough to express β-reduction of λ-calculus as a single rewrite rule. The additional expressive power has its price — CRSs are much harder to implement than ordinary TRSs.
Stefan Kahrs, Kahrs, Stefan
core +1 more source
A Rewriting View of Simple Typing [PDF]
Logical Methods in Computer Science, 2013 This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective.
Aaron Stump +3 more
doaj +1 more source
An operational interpretation of coinductive types [PDF]
Logical Methods in Computer Science, 2020 We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and generalization of the
Łukasz Czajka
doaj +1 more source
Infinitary Term Graph Rewriting is Simple, Sound and Complete [PDF]
, 2012 Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We show that, similarly to infinitary term rewriting, the partial order formalisation yields a conservative extension of the ...
Bahr, Patrick; id_orcid, Bahr, Patrick
core +1 more source
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples [PDF]
Logical Methods in Computer Science, 2014 We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial.
Joerg Endrullis +4 more
doaj +1 more source
Inequational Deduction as Term Graph Rewriting
, 2007 Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a simple inequational deduction system, based on term graphs, for inferring
Koenig B. +3 more
core +1 more source
Total termination of term rewriting
Applicable Algebra in Engineering, Communication and Computing, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferreira, M.C.F., Zantema, H.
openaire +5 more sources
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New? [PDF]
, 2011 International audienceConnections between Tree Automata and Term Rewriting are now well known. Whereas tree automata can be viewed as a subclass of ground rewrite systems, tree automata are successfully used as decision tools in rewriting theory ...
Tison, Sophie
core +1 more source
Early Palaiologan Hagiography: “Old” and “New” Saints under the Shadow of Symeon Metaphrastes
Античная древность и средние века, 2022 This article focuses on the hagiographical rewriting from the Palaiologan Period. Having outlined the corpus of relevant texts, the author discusses the two paradigms that currently permeate the scholarship dealing with the Late Byzantine hagiography ...
Lev Vsevolodovich Lukhovitskiy
doaj +1 more source