Open problems in rewriting (Q5055780): Difference between revisions

@@ Property / describes a project that uses @@
+Automath
@@ Property / describes a project that uses: Automath / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-53904-2_120
+Normal rank
@@ Property / OpenAlex ID @@
+W1550542381
@@ Property / OpenAlex ID: W1550542381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993363
@@ Property / cites work: Q3993363 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484358
@@ Property / cites work: Q3484358 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000281
@@ Property / cites work: Q4000281 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets of reductions modulo associativity, commutativity and identity
+Normal rank
@@ Property / cites work @@
+Introduction to generalized type systems
@@ Property / cites work: Introduction to generalized type systems / rank @@
+Normal rank
@@ Property / cites work @@
+The lambda calculus. Its syntax and semantics. Rev. ed.
+Normal rank
@@ Property / cites work @@
+n-level rewriting systems
@@ Property / cites work: n-level rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting systems by polynomial interpretations and its implementation
+Normal rank
@@ Property / cites work @@
+Systems of reductions
@@ Property / cites work: Systems of reductions / rank @@
+Normal rank
@@ Property / cites work @@
+Conditional rewrite rules: Confluence and termination
+Normal rank
@@ Property / cites work @@
+Minimal and Optimal Computations of Recursive Programs
+Normal rank
@@ Property / cites work @@
+Conditional rewriting in focus
@@ Property / cites work: Conditional rewriting in focus / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation of Turing machines by a left-linear rewrite rule
+Normal rank
@@ Property / cites work @@
+Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
+Normal rank
@@ Property / cites work @@
+Corrigendum to ``Termination of rewriting''
@@ Property / cites work: Corrigendum to ``Termination of rewriting'' / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
+Normal rank
@@ Property / cites work @@
+Existence, Uniqueness, and Construction of Rewrite Systems
+Normal rank
@@ Property / cites work @@
+A rationale for conditional equational programming
+Normal rank
@@ Property / cites work @@
+Associative-commutative unification
@@ Property / cites work: Associative-commutative unification / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035665
@@ Property / cites work: Q4035665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4722037
@@ Property / cites work: Q4722037 / rank @@
+Normal rank
@@ Property / cites work @@
+Refutational theorem proving using term-rewriting systems
+Normal rank
@@ Property / cites work @@
+A complete proof of correctness of the Knuth-Bendix completion algorithm
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Q3992573
@@ Property / cites work: Q3992573 / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting techniques and applications. (First International Conference), Dijon, France, May 20-22, 1985
+Normal rank
@@ Property / cites work @@
+Completion of a Set of Rules Modulo a Set of Equations
+Normal rank
@@ Property / cites work @@
+Termination and completion modulo associativity, commutativity and identity
+Normal rank
@@ Property / cites work @@
+Q4036585
@@ Property / cites work: Q4036585 / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Sequential evaluation strategies for parallel-or and related reduction systems
+Normal rank
@@ Property / cites work @@
+Transfinite reductions in orthogonal term rewriting systems
+Normal rank
@@ Property / cites work @@
+Accessible Independence Results for Peano Arithmetic
+Normal rank
@@ Property / cites work @@
+Q4619820
@@ Property / cites work: Q4619820 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3918095
@@ Property / cites work: Q3918095 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3817590
@@ Property / cites work: Q3817590 / rank @@
+Normal rank
@@ Property / cites work @@
+Extended term rewriting systems
@@ Property / cites work: Extended term rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Unique normal forms for lambda calculus with surjective pairing
+Normal rank
@@ Property / cites work @@
+On recursive path ordering
@@ Property / cites work: On recursive path ordering / rank @@
+Normal rank
@@ Property / cites work @@
+On relationship between term rewriting systems and regular tree languages
+Normal rank
@@ Property / cites work @@
+Explicit representation of terms defined by counter examples
+Normal rank
@@ Property / cites work @@
+Rewriting techniques and applications. Bordeaux, France, May 25--27, 1987. Proceedings. (2nd International Conference)
+Normal rank
@@ Property / cites work @@
+Calcul de longueurs de chaînes de réécriture dans le monoïde libre
+Normal rank
@@ Property / cites work @@
+Modular aspects of properties of term rewriting systems related to normal forms
+Normal rank
@@ Property / cites work @@
+Clausal rewriting
@@ Property / cites work: Clausal rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q3776590
@@ Property / cites work: Q3776590 / rank @@
+Normal rank
@@ Property / cites work @@
+The Church-Rosser property for ground term-rewriting systems is decidable
+Normal rank
@@ Property / cites work @@
+Complete Sets of Reductions for Some Equational Theories
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank
@@ Property / cites work @@
+Term rewriting: Some experimental results
@@ Property / cites work: Term rewriting: Some experimental results / rank @@
+Normal rank
@@ Property / cites work @@
+Q3338215
@@ Property / cites work: Q3338215 / rank @@
+Normal rank
@@ Property / cites work @@
+A refinement of strong sequentiality for term rewriting with constructors
+Normal rank
@@ Property / cites work @@
+Q3830525
@@ Property / cites work: Q3830525 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3358706
@@ Property / cites work: Q3358706 / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction graphs in the lambda calculus
@@ Property / cites work: Reduction graphs in the lambda calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Q3202990
@@ Property / cites work: Q3202990 / rank @@
+Normal rank