The following pages link to (Q4890709):
Displayed 35 items.
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← 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)
- Type soundness for path polymorphism (Q1744425) (← 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)
- Commutative rational term rewriting (Q2232282) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Typed path polymorphism (Q2424892) (← links)
- Modeling Pointer Redirection as Cyclic Term-graph Rewriting (Q2867899) (← links)
- Term-graph Rewriting in Tom Using Relative Positions (Q2870309) (← links)
- Towards a Sharing Strategy for the Graph Rewriting Calculus (Q2873680) (← links)
- Computational Soundness of a Call by Name Calculus of Recursively-scoped Records (Q2873682) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← 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)
- A Heterogeneous Pushout Approach to Term-Graph Transformation (Q3636827) (← links)
- Initial Algebra Semantics for Cyclic Sharing Structures (Q3637190) (← 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)
- Term graph rewriting (Q4645801) (← links)
- A complete proof system for Nested Term Graphs (Q4645805) (← links)
- Categorical rewriting of term-like structures (Q4923533) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- Term-Graph Anti-Unification (Q4993335) (← links)
- (Q5021233) (← links)
- Patch Graph Rewriting (Q5100730) (← links)
- Clocks for Functional Programs (Q5410452) (← links)
- Compiling Collapsing Rules in Certain Constructor Systems (Q5743585) (← links)
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity (Q6135767) (← links)