Titlebook: Rewriting Techniques and Applications; 15th International C Vincent Oostrom Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 2

桉树

消毒

小卷发

,Böhm-Like Trees for Term Rewriting Systems,y-Longo trees, and the Berarducci trees. That is, the similarities between the Böhm-like trees of the .-calculus. Given a term . a tree partially represents the root-stable part of . as created in each maximal fair reduction of .. In addition to defining Böhm-like trees for TRSs we define a subclass

faction

Inductive Theorems for Higher-Order Rewriting,orems is introduced to reflect higher-order feature of simply typed term rewriting. Then the inductionless induction methods in first-order term rewriting are incorporated to verify higher-order inductive theorems. In order to ensure that higher-order inductive theorems are closed under contexts, th

Offset

大包裹

Monadic Second-Order Unification Is NP-Complete,Monadic Second-Order Unification (MSOU) is Second-Order Unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding whether a set of monadic equations has a unifier is NP-complete. We also prove that Monadic Second-Order Matching is also NP-complete.

WAG

TORPA: Termination of Rewriting Proved Automatically,The tool TORPA (Termination of Rewriting Proved Automatically) can be used to prove termination of string rewriting systems (SRSs) fully automatically. The underlying techniques include semantic labelling, polynomial interpretations, recursive path order, the dependency pair method and match bounds of right hand sides of forward closures.

paragon

floodgate

蕨类

Vincent OostromIncludes supplementary material: