Titlebook: Rewriting Techniques and Applications; 7th International Co Harald Ganzinger Conference proceedings 1996 Springer-Verlag Berlin Heidelberg

Axon895

,Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (ext by .-expansion. For that, we propose a general scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our general scheme makes it possible to treat at the same time many well-known calculi such as λ., λ. and λ., or some other new cal

preservative

On the power of simple diagrams,rmalization modularly, especially when adding rewriting rules for extensional equalities to various calculi. We show the usefulness of the lemmas by applying them to various systems, ranging from simply typed lambda calculus to higher order lambda calculi, for which we can establish systematically c

AUGER

接觸

人類學家

愛社交

Badger

Modularity of termination in term graph rewriting,ng term. In this paper, we study modularity of termination of the graph reduction. Unlike in the case of term rewriting, termination is modular in graph rewriting for a large class of systems. Our results generalize the results of Plump [14] and Kurihara and Ohuchi [10].

Distribution

Termination of constructor systems, problem we have developed a transformation technique which enables the application of known synthesis methods for well-founded orderings to prove that dependency pairs are decreasing. In this way termination of many (also non-simply terminating) constructor systems can be proved fully automatically.

陳舊

Dummy elimination in equational rewriting, presence of equational theories. Furthermore using the same proof technique, the soundness of a family of transformations (containing dummy elimination) can be shown. This work was motivated by an application in the area of Process Algebra.

武器