Determinization of conditional term rewriting systems
From MaRDI portal
Publication:1929232
Recommendations
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Reachability in conditional term rewriting systems
- scientific article; zbMATH DE number 4090846
- On soundness conditions for unraveling deterministic conditional rewrite systems
- scientific article; zbMATH DE number 1696594
- Complexity of conditional term rewriting
- Combinations of simplifying conditional term rewriting systems
- Conditional term rewriting and first-order theorem proving
- Confluence of terminating conditional rewrite systems revisited
- Dependency pairs for proving termination properties of conditional term rewriting systems
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- A method for automatic program inversion based on LR(0) parsing
- A program inverter for a functional language with equality and constructors.
- A transformation system for deductive database modules with perfect model semantics
- Automatic Partial Inversion of Inductively Sequential Functions
- BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
- Completeness results for basic narrowing
- Conditional rewrite rules: Confluence and termination
- Constraint-based correctness proofs for logic program transformations
- Equivalence-preserving first-order unfold/fold transformation systems
- Modularity of simple termination of term rewriting systems with shared constructors
- On soundness conditions for unraveling deterministic conditional rewrite systems
- Operational termination of conditional term rewriting systems
- Order-sorted completion: The many-sorted way
- Orderings for term-rewriting systems
- Program development in computational logic. A decade of research advances in logic-based program development.
- Program inversion for tail recursive functions
- Rules + strategies for transforming lazy functional logic programs
- Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
- Term Rewriting and Applications
- Termination of term rewriting using dependency pairs
- Transformations of CLP modules
- Transforming constraint logic programs
- Unfold⧸fold transformation of general logic programs for the well-founded semantics
- Unravelings and ultra-properties
- Verification of Erlang processes by dependency pairs
Cited in
(14)- Deterministic Caterpillar Expressions
- Semi-inversion of conditional constructor term rewriting systems
- Conditional term rewriting and first-order theorem proving
- Computing more specific versions of conditional rewriting systems
- scientific article; zbMATH DE number 3878354 (Why is no real title available?)
- Determinization of inverted grammar programs via context-free expressions
- Narrowing trees for syntactically deterministic conditional term rewriting systems
- scientific article; zbMATH DE number 4092758 (Why is no real title available?)
- Reversible computation in term rewriting
- Inverse Unfold Problem and Its Heuristic Solving
- scientific article; zbMATH DE number 4092746 (Why is no real title available?)
- Quantum gravity effects on the radiation of a stimulated emission from quantum black holes
- Modular properties of conditional term rewriting systems
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
This page was built for publication: Determinization of conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929232)
