Conditional rewrite rules: Confluence and termination
From MaRDI portal
DOI10.1016/0022-0000(86)90033-4zbMATH Open0658.68031OpenAlexW2167316540MaRDI QIDQ1111368FDOQ1111368
Authors: J. A. Bergstra, Jan Willem Klop 
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/12720
Recommendations
confluenceterm rewriting systemsterminationalgebraic specificationsreduction techniquesconditional rewrite rules
Cites Work
- Initial Algebra Semantics and Continuous Algebras
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Title not available (Why is that?)
- Conditional rewrite rules
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing in systems described by equations
- Minimal and Optimal Computations of Recursive Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (60)
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Inverse Unfold Problem and Its Heuristic Solving
- Implementing conditional term rewriting by graph rewriting
- Proving confluence in the confluence framework with confident
- Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Deductive and inductive synthesis of equational programs
- Strict coherence of conditional rewriting modulo axioms
- Rewrite method for theorem proving in first order theory with equality
- Local Confluence for Rules with Nested Application Conditions
- Incremental constraint satisfaction for equational logic programming
- Negation with logical variables in conditional rewriting
- Open problems in rewriting
- Conditional linearization
- Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
- On the confluence of lambda-calculus with conditional rewriting
- Priority rewriting: Semantics, confluence, and conditionals
- Determinization of conditional term rewriting systems
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Logicality of conditional rewrite systems
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Completeness results for basic narrowing
- Proving termination of (conditional) rewrite systems. A semantic approach
- Applications and extensions of context-sensitive rewriting
- Confluence of terminating membership conditional TRS
- Evaluation strategies for functional logic programming
- Sequentiality in orthogonal term rewriting systems
- Term-rewriting systems with rule priorities
- Completion-time optimization of rewrite-time goal solving
- Title not available (Why is that?)
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
- Levels of undecidability in rewriting
- Nominal rewriting
- Rewriting systems over similarity and generalized pseudometric spaces and their properties
- Transformation for refining unraveled conditional term rewriting systems
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Reversible computation in term rewriting
- Implementing term rewrite languages in DACTL
- Shallow confluence of conditional term rewriting systems
- Conditional equational theories and complete sets of transformations
- Normal forms and normal theories in conditional rewriting
- Confluence of terminating conditional rewrite systems revisited
- Extended term rewriting systems
- A rationale for conditional equational programming
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Operational termination of conditional term rewriting systems
- Conditional rewrite rules
- Origin tracking
- Evaluation strategies for functional logic programming
- Functional Logic Programming: From Theory to Curry
- Transformations of Conditional Rewrite Systems Revisited
- Kernel-LEAF: A logic plus functional language
- A sequential reduction strategy
- Confluence of the disjoint union of conditional term rewriting systems
- Elimination of conditions
- Equational rules for rewriting logic
- A combinatory logic approach to higher-order E-unification
- A completion procedure for conditional equations
- Equational type logic
This page was built for publication: Conditional rewrite rules: Confluence and termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111368)
