Normal forms and normal theories in conditional rewriting
From MaRDI portal
Publication:730473
DOI10.1016/J.JLAMP.2015.06.001zbMATH Open1356.68124OpenAlexW1140833825MaRDI QIDQ730473FDOQ730473
Authors: Salvador Lucas, José Meseguer 
Publication date: 28 December 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.06.001
Recommendations
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Termination of term rewriting using dependency pairs
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Conditional rewriting logic as a unified model of concurrency
- Proving operational termination of membership equational programs
- Rewriting modulo SMT and open system analysis
- Title not available (Why is that?)
- Language prototyping: An algebraic specification approach
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- Completion of a Set of Rules Modulo a Set of Equations
- Logicality of conditional rewrite systems
- Termination Modulo Combinations of Equational Theories
- Order-Sorted Rewriting and Congruence Closure
- Strong and weak operational termination of order-sorted rewrite theories
- Localized operational termination in general logics
Cited In (24)
- Generalized rewrite theories, coherence completion, and symbolic methods
- Strict coherence of conditional rewriting modulo axioms
- Symbolic computation in Maude: some tapas
- Normalization properties for shallow TRS and innermost rewriting
- Ground confluence of order-sorted conditional specifications modulo axioms
- Title not available (Why is that?)
- Sufficiency Conditions for Bokut' Normal Forms
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Use of logical models for proving infeasibility in term rewriting
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- Applications and extensions of context-sensitive rewriting
- Title not available (Why is that?)
- Symbolic Specialization of Rewriting Logic Theories with Presto
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trace rewriting: Computing normal forms in time O(n log n)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- Programming and symbolic computation in Maude
- Strong and weak operational termination of order-sorted rewrite theories
- Dependency pairs for proving termination properties of conditional term rewriting systems
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- Checking Sufficient Completeness by Inductive Theorem Proving
- Normal forms and syntactic completeness proofs for functional independencies
Uses Software
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)
