The following pages link to (Q5287535):
Displayed 12 items.
- Locating the contractum in the double pushout approach (Q672236) (← 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)
- Embedding and Confluence of Graph Transformations with Negative Application Conditions (Q3540396) (← links)
- Unfolding-Based Diagnosis of Systems with an Evolving Topology (Q3541019) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)