Normal forms and normal theories in conditional rewriting
From MaRDI portal
(Redirected from Publication:730473)
Recommendations
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Completion of a Set of Rules Modulo a Set of Equations
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Conditional rewriting logic as a unified model of concurrency
- Language prototyping: An algebraic specification approach
- Localized operational termination in general logics
- Logicality of conditional rewrite systems
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- Operational termination of conditional term rewriting systems
- Order-Sorted Rewriting and Congruence Closure
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Proving operational termination of membership equational programs
- Rewriting modulo SMT and open system analysis
- Strong and weak operational termination of order-sorted rewrite theories
- Termination Modulo Combinations of Equational Theories
- Termination of term rewriting using dependency pairs
Cited in
(24)- scientific article; zbMATH DE number 3876576 (Why is no real title available?)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- Symbolic Specialization of Rewriting Logic Theories with Presto
- scientific article; zbMATH DE number 1941934 (Why is no real title available?)
- Programming and symbolic computation in Maude
- Checking Sufficient Completeness by Inductive Theorem Proving
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- Normal forms and syntactic completeness proofs for functional independencies
- Ground confluence of order-sorted conditional specifications modulo axioms
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Strict coherence of conditional rewriting modulo axioms
- Sufficiency Conditions for Bokut' Normal Forms
- Generalized rewrite theories, coherence completion, and symbolic methods
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- scientific article; zbMATH DE number 1615232 (Why is no real title available?)
- Applications and extensions of context-sensitive rewriting
- Strong and weak operational termination of order-sorted rewrite theories
- Symbolic computation in Maude: some tapas
- Normalization properties for shallow TRS and innermost rewriting
- scientific article; zbMATH DE number 7453112 (Why is no real title available?)
- scientific article; zbMATH DE number 7455704 (Why is no real title available?)
- Trace rewriting: Computing normal forms in time O(n log n)
- Use of logical models for proving infeasibility in term rewriting
This page was built for publication: Normal forms and normal theories in conditional rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730473)
