Titlebook: Rewriting Techniques and Applications; 9th International Co Tobias Nipkow Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 199

古董

DEAWL

Origin tracking in term rewriting,g and in higher-order rewriting, such as lambda calculus. Recently this classical notion has been given much attention. On the one hand, the notion has been studied in an abstract, axiomatic way, in order to isolate the essential properties of the descendant concept. On the other hand descendants we

Gesture

玩忽職守

INCUR

Automatic monoids versus monoids with finite convergent presentations,hrough finite automata based on a regular set of (not necessarily unique) representatives for the group, and hence, each automatic group has a tractable word problem and low derivational complexity. Consequently it has been asked whether corresponding results also hold for .. Here we show that there

認(rèn)為

斜坡

On the exponent of periodicity of minimal solutions of context equations,ation was proved by Makanin, the decidability of context unification is currently an open question. This paper provides a step in understanding the complexity of context unification and the structure of unifiers. It is shown, that if a context unification problem of size . is unifiable, then there i

原告

Unification in extensions of shallow equational theories,standard equational theories. In order to prove decidability of unification in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality constraints between brother subterms as well as shallow

arthroscopy

Unification and matching in process algebras, as two process algebraic terms with . variables are said to be compatible modulo some equivalence relation if a substitution on the free variables can make the resulting terms equivalent modulo that relation. We formulate this compatibility (modulo an equivalence relation) checking problems as . in

流浪者