The following pages link to (Q4890709):
Displayed 11 items.
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Orders, reduction graphs and spectra (Q1275630) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- A uniform framework for term and graph rewriting applied to combined systems (Q1583048) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Bisimilarity in term graph rewriting. (Q1854321) (← links)
- Term-Graph Rewriting Via Explicit Paths (Q3522007) (← links)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) (← links)
- An inside view of EXP; or, The closed fragment of the provability logic of I<i>Δ</i><sub>0</sub> + <i>Ω</i><sub>1</sub> with a prepositional constant for EXP (Q4008752) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)