Open problems in rewriting (Q5055780): Difference between revisions

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

Latest revision as of 01:58, 31 July 2024

scientific article; zbMATH DE number 7631191
Language Label Description Also known as
English
Open problems in rewriting
scientific article; zbMATH DE number 7631191

    Statements

    Open problems in rewriting (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers