Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proof-theoretic analysis of termination proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic higher-order recursive path orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A termination ordering for higher order rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple termination of rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank

Latest revision as of 15:35, 28 June 2024

scientific article
Language Label Description Also known as
English
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
scientific article

    Statements