The following pages link to The λ-calculus is ω-incomplete (Q4053617):
Displaying 13 items.
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- Partial evaluation and \(\omega\)-completeness of algebraic specifications (Q1084849) (← links)
- Implication and analysis in classical Frege structures (Q1095139) (← links)
- Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
- Which data types have \(\omega\)-complete initial algebra specifications? (Q1318728) (← links)
- Kleene's Logic with equality (Q1603370) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- (Q4625694) (← links)
- (Q5111316) (← links)
- Reasoning about multi-stage programs (Q5371979) (← links)
