The following pages link to Infinitary lambda calculus (Q1392145):
Displaying 41 items.
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- Substitution in non-wellfounded syntax with variable binding (Q703526) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Coinductive big-step operational semantics (Q1012129) (← 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)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Infinitary lambda calculus (Q1392145) (← links)
- On the algebraic models of lambda calculus (Q1583488) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
- Confluence of the coinductive \(\lambda\)-calculus (Q1884931) (← links)
- Limiting partial combinatory algebras (Q1884934) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- Counterexamples in infinitary rewriting with non-fully-extended rules (Q1944100) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- On modularity in infinitary term rewriting (Q2496298) (← links)
- On the complexity of stream equality (Q2875229) (← links)
- A Light Modality for Recursion (Q2988388) (← links)
- (Q3300788) (← links)
- On Normalisation of Infinitary Combinatory Reduction Systems (Q3522017) (← links)
- Comparing Böhm-Like Trees (Q3636829) (← links)
- Term graph rewriting (Q4645801) (← links)
- From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
- Encoding many-valued logic in $\lambda$-calculus (Q5009711) (← links)
- (Q5089036) (← links)
- Böhm Reduction in Infinitary Term Graph Rewriting Systems (Q5111303) (← links)
- (Q5216302) (← links)
- (Q5227520) (← links)
- Infinitary affine proofs (Q5268998) (← links)
- The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) (← links)
- Clocked lambda calculus (Q5269007) (← links)
- Non-linearity as the Metric Completion of Linearity (Q5300890) (← links)
- Types for Hereditary Head Normalizing Terms (Q5458437) (← links)
- Completeness and Herbrand theorems for nominal logic (Q5477637) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications (Q6178717) (← links)
