MTT

swMATH9783MaRDI QIDQ21762FDOQ21762

Author name not available (Why is that?)

Cited In (25)

• Operational termination of membership equational programs: the order-sorted way
• Twenty years of rewriting logic
• Modular termination of basic narrowing and equational unification
• Symbolic computation in Maude: some tapas
• Ground confluence of order-sorted conditional specifications modulo axioms
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• MTT: The Maude Termination Tool (System Description)
• Applications and extensions of context-sensitive rewriting
• Behavioral rewrite systems and behavioral productivity
• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
• Automated reasoning. 4th international joint conference, IJCAR 2008, Sydney, Australia, August 12--15, 2008 Proceedings
• Integrating Maude into Hets
• A compact fixpoint semantics for term rewriting systems
• Methods for proving termination of rewriting-based programming languages by transformation
• A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
• Localized operational termination in general logics
• Optimization of rewrite theories by equational partial evaluation
• Equational abstractions
• Termination Modulo Combinations of Equational Theories
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Sufficient completeness verification for conditional and constrained TRS
• Two Decades of Maude
• A Maude coherence checker tool for conditional order-sorted rewrite theories
• Proving termination properties with \textsc{mu-term}

This page was built for software: MTT