Open problems in rewriting
From MaRDI portal
Cites work
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- A rationale for conditional equational programming
- A refinement of strong sequentiality for term rewriting with constructors
- Accessible Independence Results for Peano Arithmetic
- Associative-commutative unification
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre
- Clausal rewriting
- Complete Sets of Reductions for Some Equational Theories
- Complete sets of reductions modulo associativity, commutativity and identity
- Completion of a Set of Rules Modulo a Set of Equations
- Conditional rewrite rules: Confluence and termination
- Conditional rewriting in focus
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Corrigendum to ``Termination of rewriting
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Existence, Uniqueness, and Construction of Rewrite Systems
- Explicit representation of terms defined by counter examples
- Extended term rewriting systems
- scientific article; zbMATH DE number 4179332 (Why is no real title available?)
- scientific article; zbMATH DE number 3871321 (Why is no real title available?)
- scientific article; zbMATH DE number 4210102 (Why is no real title available?)
- scientific article; zbMATH DE number 4155899 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 4106267 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 42760 (Why is no real title available?)
- scientific article; zbMATH DE number 44213 (Why is no real title available?)
- scientific article; zbMATH DE number 50648 (Why is no real title available?)
- scientific article; zbMATH DE number 176501 (Why is no real title available?)
- scientific article; zbMATH DE number 176755 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 7015114 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- Introduction to generalized type systems
- Minimal and Optimal Computations of Recursive Programs
- Modular aspects of properties of term rewriting systems related to normal forms
- n-level rewriting systems
- On recursive path ordering
- On relationship between term rewriting systems and regular tree languages
- On sufficient-completeness and related properties of term rewriting systems
- Reduction graphs in the lambda calculus
- Refutational theorem proving using term-rewriting systems
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Rewriting techniques and applications. (First International Conference), Dijon, France, May 20-22, 1985
- Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
- Rewriting techniques and applications. Bordeaux, France, May 25--27, 1987. Proceedings. (2nd International Conference)
- Semantic confluence tests and completion methods
- Sequential evaluation strategies for parallel-or and related reduction systems
- Simulation of Turing machines by a left-linear rewrite rule
- Systems of reductions
- Term rewriting: Some experimental results
- Termination and completion modulo associativity, commutativity and identity
- Termination of rewriting systems by polynomial interpretations and its implementation
- The Church-Rosser property for ground term-rewriting systems is decidable
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Transfinite reductions in orthogonal term rewriting systems
- Unique normal forms for lambda calculus with surjective pairing
Cited in
(10)- Bubbles in modularity
- The first-order theory of lexicographic path orderings is undecidable
- Logicality of conditional rewrite systems
- Simple termination is difficult
- More problems in rewriting
- Problems in rewriting III
- scientific article; zbMATH DE number 7204433 (Why is no real title available?)
- Decidability of regularity and related properties of ground normal form languages
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification
- Lambda-definable term rewriting systems
This page was built for publication: Open problems in rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055780)
