Titlebook: Conditional Term Rewriting Systems; Third International Micha?l Rusinowitch,Jean-Luc Rémy Conference proceedings 1993 Springer-Verlag Berl

ossicles

書目名稱Conditional Term Rewriting Systems影響因子(影響力)




書目名稱Conditional Term Rewriting Systems影響因子(影響力)學(xué)科排名




書目名稱Conditional Term Rewriting Systems網(wǎng)絡(luò)公開度




書目名稱Conditional Term Rewriting Systems網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Conditional Term Rewriting Systems被引頻次




書目名稱Conditional Term Rewriting Systems被引頻次學(xué)科排名




書目名稱Conditional Term Rewriting Systems年度引用




書目名稱Conditional Term Rewriting Systems年度引用學(xué)科排名




書目名稱Conditional Term Rewriting Systems讀者反饋




書目名稱Conditional Term Rewriting Systems讀者反饋學(xué)科排名

paltry

不適當(dāng)

Explicit cyclic substitutions, lsexplicit substitutions’ used by Abadi, Cardelli, Curien, and Lévy [1] to describe sharing in .-terms. This leads to ‘explicit cyclic substitutions’ that can describe the mutual sharing of local recursive definitions. We demonstrate how this may be used to describe standard binding constructions (

反話

泥瓦匠

不容置疑

Collapsed tree rewriting: Completeness, confluence, and modularity,rees include applications of term rewrite rules as well as “folding steps” which identify common subexpressions. Different aspects of this model of computation are considered: (1) It is shown that collapsed tree rewriting is complete with respect to equational validity in the same sense as term rewr

不容置疑

Combinations of simplifying conditional term rewriting systems,any rewrite rule is greater than the right-hand side and the terms occurring in the conditions of that rule. If a simplifying join CTRS consists of finitely many rules, it is terminating and the applicability of a rewrite rule is decidable by recursively reducing the terms in the conditions. Conside

恃強凌弱

incarcerate

,Termination of combined (rewrite and λ-calculus) systems,iting systems in contrast to (extensions of) Tait-Girard‘s technique. In particular for some class of higher-order rule systems, we explicitly construct a well-founded ordering over .-terms whose combination with the .-reduction is terminating. Then, by embedding the higher-order rewriting relation

細節(jié)

Type removal in term rewriting,ncy turns out to be a generalization of direct sum modularity. It is a more powerful tool for proving confluence and normalization properties. Strong normalization is persistent for the class of term rewriting systems for which not both duplicating rules and collapsing rules occur, generalizing a si