Deduction, Strategies, and Rewriting

DOI10.1016/j.entcs.2006.03.017zbMath1277.68241OpenAlexW2045721873WikidataQ123905880 ScholiaQ123905880MaRDI QIDQ2864357

José Meseguer, Alberto Verdejo, Narciso Martí-Oliet, Steven Eker

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.03.017

zbMATH Keywords

rewriting strategiesrewriting logicMaudecongruence closure

Mathematics Subject Classification ID

Related Items (13)

Parameterized strategies specification in Maude ⋮ Twenty years of rewriting logic ⋮ The Maude strategy language ⋮ Compositional Specification in Rewriting Logic ⋮ Strategies in conditional narrowing modulo SMT plus axioms ⋮ A Maude environment for CafeOBJ ⋮ Strategy-Based Proof Calculus for Membrane Systems ⋮ Patterns for Maude Metalanguage Applications ⋮ Proof Search for the First-Order Connection Calculus in Maude ⋮ A Rewriting Semantics for Maude Strategies ⋮ Unnamed Item ⋮ Programming and symbolic computation in Maude ⋮ A rewriting logic approach to operational semantics

Uses Software

• Stratego
• Maude
• ITP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewriting logic as a unified model of concurrency
• Completion for rewriting modulo a congruence
• Abstract congruence closure
• Maude: specification and programming in rewriting logic
• Reflection in conditional rewriting logic
• Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics
• Variations on the Common Subexpression Problem
• An Efficient Unification Algorithm
• An algorithm for reasoning about equality
• Shostak's congruence closure as completion
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Reflective metalogical frameworks
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Deduction, Strategies, and Rewriting