The following pages link to (Q4259973):
Displaying 23 items.
- On equal \(\mu \)-terms (Q549186) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- Counterexamples in infinitary rewriting with non-fully-extended rules (Q1944100) (← links)
- Infinitary rewriting: closure operators, equivalences and models (Q2376981) (← links)
- On confluence and residuals in Cauchy convergent transfinite rewriting (Q2390300) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- On Normalisation of Infinitary Combinatory Reduction Systems (Q3522017) (← links)
- Comparing Böhm-Like Trees (Q3636829) (← links)
- (Q4263482) (← links)
- From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
- Strict ideal completions of the lambda calculus (Q4993334) (← links)
- Homogeneity without loss of generality (Q4993359) (← links)
- Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
- (Q5109521) (← links)
- Böhm Reduction in Infinitary Term Graph Rewriting Systems (Q5111303) (← links)
- (Q5216302) (← links)
- The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) (← links)
- Intersection types for \(\lambda\)-trees (Q5958291) (← links)
- Light genericity (Q6629516) (← links)
