scientific article; zbMATH DE number 794240

zbMath0839.68050MaRDI QIDQ4847000

Hans Zantema

Publication date: 25 June 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(\lambda\)-calculusterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (48)

Relative termination via dependency pairs ⋮ Right-linear half-monadic term rewrite systems ⋮ Harnessing First Order Termination Provers Using Higher Order Dependency Pairs ⋮ Rewrite systems for integer arithmetic ⋮ Termination of constructor systems ⋮ Dummy elimination in equational rewriting ⋮ Termination of string rewriting proved automatically ⋮ Tyrolean termination tool: techniques and features ⋮ Mechanizing and improving dependency pairs ⋮ Size-based termination of higher-order rewriting ⋮ An improved general path order ⋮ Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Simple termination of rewrite systems ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Root-Labeling ⋮ Automated Implicit Computational Complexity Analysis (System Description) ⋮ Termination of term rewriting using dependency pairs ⋮ Natural termination ⋮ Adding constants to string rewriting ⋮ Transforming termination by self-labelling ⋮ Unnamed Item ⋮ Explicit Substitutions à la de Bruijn ⋮ Lazy productivity via termination ⋮ Normalisation for higher-order calculi with explicit substitutions ⋮ Zero, successor and equality in BDDs ⋮ A new look at the automatic synthesis of linear ranking functions ⋮ From Outermost Termination to Innermost Termination ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proof-term synthesis on dependent-type systems via explicit substitutions ⋮ Complexity Analysis by Rewriting ⋮ Applications and extensions of context-sensitive rewriting ⋮ Termination of Isabelle Functions via Termination of Rewriting ⋮ Composing proof terms ⋮ Local Termination ⋮ From Outermost to Context-Sensitive Rewriting ⋮ Explicit substitution. On the edge of strong normalization ⋮ The Derivational Complexity Induced by the Dependency Pair Method ⋮ On the Relation between Sized-Types Based Termination and Semantic Labelling ⋮ Transforming SAT into Termination of Rewriting ⋮ Pattern-matching algorithms based on term rewrite systems ⋮ Term orderings for non-reachability of (conditional) rewriting ⋮ Innermost Termination of Rewrite Systems by Labeling ⋮ Termination by absence of infinite chains of dependency pairs

This page was built for publication: