Critical pairs in term graph rewriting (Q5096914): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REDEX CAPTURING IN TERM GRAPH REWRITING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reduction. Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29 - October 1, 1986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing term rewriting by jungle evaluation / 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: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3657415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapsed tree rewriting: Completeness, confluence, and modularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287535 / rank
 
Normal rank

Latest revision as of 21:46, 29 July 2024

scientific article; zbMATH DE number 7573218
Language Label Description Also known as
English
Critical pairs in term graph rewriting
scientific article; zbMATH DE number 7573218

    Statements

    Identifiers