TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING

Keywords

Rewriting, Term (time), Labelling, Computer science, Confluence

References

• 30周年記念論文 佳作：Modularity of Simple Termination of Term Rewriting SystemsKurihara Mashito, Azuma Ohuchi — 1990
• Proof of termination of the rewriting system subst on CCLThérèse Hardin, Alain Laville — 1986
• Using Unavoidable Set of Trees to Generalize Kruskal's TheoremLaurence Puel — 1989
• Modularity of Simple Termination of Term Rewriting Systems with Shared ConstructorsMasahito Kurihara, Azuma Ohuchi — 1992
• Termination of Term Rewriting: Interpretation and Type EliminationHans Zantema — 1994
• Simplifying Conditional Term Rewriting Systems: Unification, Termination and ConfluenceStéphane Kaplan — 1987
• Well Rewrite Orderings and Well Quasi-OrderingsPierre Lescanne — 1992
• Counterexamples to Termination for the Direct Sum of Term Rewriting SystemsYoshihito Toyama — 1987
• Termination of logic programs via labelled term rewrite systemsThjj Thomas Arts, Hans Zantema — 1994
• Well rewrite orderingsPierre Lescanne — 1990
• Basic Process Algebra with Iteration: Completeness of its Equational AxiomsWan Fokkink — 1993
• Algebra of Communicating Processes with AbstractionJ.A. Bergstra, Jan Willem Klop — 1985
• Explicit substitutionsM. Abadi, Pierre-Louis Curien, Jean-Jacques Lévy — 1989
• Termination of Term Rewriting by InterpretationHans Zantema — 1992
• Computational logicN. Levin — 1949
• A Note on Simple Termination of Infinite Term Rewriting SystemsEnno Ohlebusch — 1992
• Termination of Order-sorted RewritingIsabelle Gnaedig — 1992
• Extensions and Comparison of Simplification OrderingsJ. Steinbach — 1989
• Embedding with Patterns and Associated Recursive Path OrderingLaurence Puel — 1989
• Simple Termination RevisitedA. Middeldorp, H. Zantema — 1994

Cited by

• Tree lifting orderings for termination transformations of term rewriting systemsTakahito Aoto, Yoshihito Toyama — 1997
• Termination of non-simple rewrite systemsNachum Dershowitz, C.G. Hoot — 1996
• Automated Termination Analysis for Term RewritingNao Hirokawa — 2006
• Réécriture et Modularité pour les Politiques de Sécurité. (Term Rewriting and Modularity for Security Policies)Anderson Santana de Oliveira — 2008
• Top-down labelling and modularity of term rewriting systems等人 青戸, 芳人 外山 — 1996
• On the Completeness of the Euations for the Kleene Star in BisimulationWan Fokkink — 1995
• Terminaison à base de tailles : sémantique et généralisationsCody Roux — 2011
• Dependent Types and Explicit SubstitutionsCésar Muñoz — 1999
• Certified Subterm Criterion and Certified Usable RulesChristian Sternagel, René Thiemann — 2010
• Complexity Analysis by RewritingMartin Avanzini, Georg Moser — 2008
• Advanced Topics in Term RewritingEnno Ohlebusch — 2002
• Non-looping rewritingHans Zantema, Alfons Geser — 1996
• Signature Extensions Preserve Termination - An Alternative Proof via Dependency PairsChristian Sternagel, René Thiemann — 2010
• Recursive path ordering for infinite labelled rewrite systemsAdam Koprowski, Hans Zantema — 2006
• Termination of rewriting and its certificationAdam Koprowski — 2004
• Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALFFairouz Kamareddine, Haiyan Qiao — 2003
• Termination Property of Inverse Finite Path Overlapping Term Rewriting System is DecidableToshimori Takai — 2002
• Explicit substitutions à la de Bruijn: the local and global wayFairouz Kamareddine, Alejandro Ríos — 2003
• A Left-Linear Variant of Lambda-SigmaAlan G. Cesar, H. Muñoz — 1997
• A Calculus of Substitutions for Incomplete-Proof Representation in Type TheoryCésar Muñoz — 1997

Related papers

• Checking Overlaps of Nominal Rewriting RulesMaurício Ayala-Rincón, Maribel Fernández, Murdoch J. Gabbay — 2016
• Proving and disproving confluence of context-sensitive rewritingSalvador Lucas, Miguel Vítores, Raúl Gutiérrez — 2022
• Development Closed Critical Pairs.V. van Oostrom — 1996
• Ground Confluence Prover based on Rewriting InductionTakahito Aoto, Yoshihito Toyama — 2016