Strict coherence of conditional rewriting modulo axioms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722701 (Why is no real title available?)
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 4130339 (Why is no real title available?)
- scientific article; zbMATH DE number 3870640 (Why is no real title available?)
- scientific article; zbMATH DE number 3827173 (Why is no real title available?)
- scientific article; zbMATH DE number 3911679 (Why is no real title available?)
- scientific article; zbMATH DE number 3949706 (Why is no real title available?)
- scientific article; zbMATH DE number 4060701 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 2043518 (Why is no real title available?)
- scientific article; zbMATH DE number 6109844 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A Noetherian and confluent rewrite system for idempotent semigroups
- A mechanical solution of Schubert's steamroller by many-sorted resolution
- A more expressive formulation of many sorted logic
- A resolution principle for a logic with restricted quantifiers
- A structural approach to operational semantics
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- CASL reference manual. The complete documentation of the common algebraic specification language.
- CASL user manual. Introduction to using the Common Algebraic Specification Language. With chapters by Till Mossakowski, Donald Sannella, and Andrzej Tarlecki. With CD-ROM.
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Complete Sets of Reductions for Some Equational Theories
- Completion for rewriting modulo a congruence
- Completion of a Set of Rules Modulo a Set of Equations
- Completion of rewrite systems with membership constraints. I: Deduction rules
- Completion of rewrite systems with membership constraints. II: Constraint solving
- Computational aspects of an order-sorted logic with term declarations
- Conditional narrowing modulo a set of equations
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Conditional rewriting logic as a unified model of concurrency
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- ELAN from a rewriting logic point of view
- Equality, types, modules, and (why not?) generics for logic programming
- Equational rules for rewriting logic
- Folding variant narrowing and optimal variant termination
- Inclusions and subtypes II: higher-order case
- Inheritance hierarchies: Semantics and unifications
- Language prototyping: An algebraic specification approach
- Logicality of conditional rewrite systems
- Methods for proving termination of rewriting-based programming languages by transformation
- Normal forms and normal theories in conditional rewriting
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Operational termination of conditional term rewriting systems
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Order-sorted algebraic specifications with higher-order functions
- Order-sorted equational unification revisited
- Order-sorted unification
- Proving operational termination of membership equational programs
- Rewriting
- Rewriting modulo SMT and open system analysis
- Semantic foundations for generalized rewrite theories
- Specification and proof in membership equational logic
- Termination Modulo Combinations of Equational Theories
- The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
- Twenty years of rewriting logic
Cited in
(20)- Optimization of rewrite theories by equational partial evaluation
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis
- A Maude coherence checker tool for conditional order-sorted rewrite theories
- Programming and symbolic computation in Maude
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Ground confluence of order-sorted conditional specifications modulo axioms
- Strategies in conditional narrowing modulo SMT plus axioms
- Variant-based equational anti-unification
- Metalevel algorithms for variant satisfiability
- Tactics for Reasoning Modulo AC in Coq
- Generalized rewrite theories and coherence completion
- Generalized rewrite theories, coherence completion, and symbolic methods
- Symbolic computation in Maude: some tapas
- scientific article; zbMATH DE number 7453112 (Why is no real title available?)
- scientific article; zbMATH DE number 7455704 (Why is no real title available?)
- Variant-Based Satisfiability in Initial Algebras
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
This page was built for publication: Strict coherence of conditional rewriting modulo axioms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683741)
