The following pages link to (Q5287535):
Displaying 41 items.
- Towards ``mouldable code'' via nested code graph transformation (Q406453) (← links)
- Graph-based communication in Eden (Q526455) (← links)
- Locating the contractum in the double pushout approach (Q672236) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Relating graph and term rewriting via Böhm models (Q1924551) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality (Q2049986) (← links)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
- Labelled graph strategic rewriting for social networks (Q2413024) (← links)
- GS·Λ Theories (Q2842817) (← links)
- On Term-Graph Rewrite Strategies (Q2873679) (← links)
- Towards a Sharing Strategy for the Graph Rewriting Calculus (Q2873680) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Embedding and Confluence of Graph Transformations with Negative Application Conditions (Q3540396) (← links)
- Unfolding-Based Diagnosis of Systems with an Evolving Topology (Q3541019) (← links)
- A Heterogeneous Pushout Approach to Term-Graph Transformation (Q3636827) (← links)
- The contractum in algebraic graph rewriting (Q4645265) (← links)
- Synchronized composition of graph grammar productions (Q4645281) (← links)
- Term graph rewriting (Q4645801) (← links)
- A complete proof system for Nested Term Graphs (Q4645805) (← links)
- Categorical rewriting of term-like structures (Q4923533) (← links)
- Solving Equations by Graph Transformation (Q4923538) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- (Q5013813) (← links)
- (Q5013889) (← links)
- (Q5018495) (← links)
- Lazy rewriting and eager machinery (Q5055828) (← links)
- Semantics and strong sequentially of priority term rewriting systems (Q5055874) (← links)
- Critical pairs in term graph rewriting (Q5096914) (← links)
- Initial Conflicts for Transformation Rules with Nested Application Conditions (Q5100729) (← links)
- Lawvere Categories as Composed PROPs (Q5739447) (← links)
- Compiling Collapsing Rules in Certain Constructor Systems (Q5743585) (← links)
- Interaction nets and term rewriting systems (extended abstract) (Q5878907) (← links)
- Relative normalization in Deterministic Residual Structures (Q5878909) (← links)
