scientific article; zbMATH DE number 1332639
From MaRDI portal
Publication:4259966
Recommendations
Cited in
(48)- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Context-sensitive rewriting strategies
- Modularity in term rewriting revisited
- Twenty years of rewriting logic
- Applications and extensions of context-sensitive rewriting
- A proof method for local sufficient completeness of term rewriting systems
- Proving operational termination of membership equational programs
- Computation by interaction for space-bounded functional programming
- Using context-sensitive rewriting for proving innermost termination of rewriting
- Methods for proving termination of rewriting-based programming languages by transformation
- Coeffects: a calculus of context-dependent computation
- Compact normalisation trace via lazy rewriting
- Lazy rewriting and context-sensitive rewriting
- Correct and complete (positive) strategy annotations for \textsf{OBJ}
- Transformation for refining unraveled conditional term rewriting systems
- Improving the context-sensitive dependency graph
- Proving termination of context-sensitive rewriting with MU-TERM
- Termination of lazy rewriting revisited
- Implicit self-adjusting computation for purely functional programs
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Rewriting strategies and strategic rewrite programs
- Complexity of conditional term rewriting
- Proving termination properties with \textsc{mu-term}
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Usable Rules for Context-Sensitive Rewrite Systems
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
- MTT: The Maude Termination Tool (System Description)
- From Outermost Termination to Innermost Termination
- Loops under Strategies
- Local Termination
- From Outermost to Context-Sensitive Rewriting
- Real_Impl
- Completeness of context-sensitive rewriting
- Confluence of prefix-constrained rewrite systems
- Automatically Proving and Disproving Feasibility Conditions
- mu-term: Verify Termination Properties Automatically (System Description)
- Completion after program inversion of injective functions
- Automatic proofs of termination with elementary interpretations
- Operational termination of membership equational programs: the order-sorted way
- On proving soundness of the computationally equivalent transformation for normal conditional term rewriting systems by using unravelings
- Polynomials over the reals in proofs of termination : from theory to practice
- Lazy productivity via termination
- Fundamentals of context-sensitive rewriting
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Relaxing monotonicity for innermost termination
- Proving termination of context-sensitive rewriting by transformation
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- Context-sensitive dependency pairs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259966)
