The following pages link to (Q4896520):
Displaying 25 items.
- Graph easy sets of mute lambda terms (Q288793) (← links)
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- A finite equational axiomatization of the functional algebras for the lambda calculus (Q1283777) (← links)
- Infinitary lambda calculus (Q1392145) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- On the algebraic models of lambda calculus (Q1583488) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- A class of bounded functions, a database language and an extended lambda calculus (Q2402281) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- Simple easy terms (Q2842831) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
- Comparing Böhm-Like Trees (Q3636829) (← links)
- (Q3837724) (← links)
- From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
- Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
- (Q5109521) (← links)
- The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) (← links)
- Clocked lambda calculus (Q5269007) (← links)
- Intersection types for \(\lambda\)-trees (Q5958291) (← links)
- Innocent game models of untyped \(\lambda\)-calculus (Q5958298) (← links)
