Pages that link to "Item:Q3486867"
From MaRDI portal
The following pages link to Implementing term rewriting by jungle evaluation (Q3486867):
Displaying 17 items.
- Towards ``mouldable code'' via nested code graph transformation (Q406453) (← links)
- Symbol different term rewrite systems (Q492918) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Bisimilarity in term graph rewriting. (Q1854321) (← links)
- A flexible categorial formalisation of term graphs as directed hypergraphs (Q2185888) (← links)
- Term-Graph Rewriting Via Explicit Paths (Q3522007) (← links)
- Essentials of Term Graph Rewriting (Q4923548) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- (Q5013889) (← links)
- (Q5018495) (← links)
- Term rewriting in CTΣ (Q5044755) (← links)
- More problems in rewriting (Q5055812) (← links)
- Jungle rewriting: An abstract description of a lazy narrowing machine (Q5096278) (← links)
- Single pushout transformations of equationally defined graph structures with applications to actor systems (Q5096285) (← links)
- Critical pairs in term graph rewriting (Q5096914) (← links)
- Collapsed tree rewriting: Completeness, confluence, and modularity (Q5881178) (← links)
