The following pages link to (Q3024919):
Displaying 18 items.
- Inhabitation of polymorphic and existential types (Q636375) (← links)
- Type checking and typability in domain-free lambda calculi (Q655411) (← links)
- Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus (Q1193590) (← links)
- Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete (Q1274981) (← links)
- Inhabitation of types in the simply typed lambda calculus (Q1893725) (← links)
- Normal proofs and their grammar (Q1917086) (← links)
- A short note on type-inhabitation: formula-trees vs. game semantics (Q2353633) (← links)
- (Q3323248) (← links)
- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types (Q3557097) (← links)
- Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them (Q4911148) (← links)
- Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic (Q4924544) (← links)
- A unifying framework for type inhabitation (Q4993331) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- (Q5091142) (← links)
- The complexity of principal inhabitation (Q5111311) (← links)
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)
- Realist Consequence, Epistemic Inference, Computational Correctness (Q5350353) (← links)
- A partial translation from λU to λ2 (Q5739981) (← links)
