MTT

swMATH9783MaRDI QIDQ21762

No author found.

Related Items (25)

Modular termination of basic narrowing and equational unification ⋮ Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ Two Decades of Maude ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ MTT: The Maude Termination Tool (System Description) ⋮ The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques ⋮ Equational abstractions ⋮ Behavioral Rewrite Systems and Behavioral Productivity ⋮ Automated reasoning. 4th international joint conference, IJCAR 2008, Sydney, Australia, August 12--15, 2008 Proceedings ⋮ Operational Termination of Membership Equational Programs: the Order-Sorted Way ⋮ A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications ⋮ A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Integrating Maude into Hets ⋮ Proving Termination Properties with mu-term ⋮ Ground confluence of order-sorted conditional specifications modulo axioms ⋮ Applications and extensions of context-sensitive rewriting ⋮ Methods for Proving Termination of Rewriting-based Programming Languages by Transformation ⋮ Termination Modulo Combinations of Equational Theories ⋮ Localized Operational Termination in General Logics ⋮ Symbolic computation in Maude: some tapas

This page was built for software: MTT