Pages that link to "Item:Q655411"
From MaRDI portal
The following pages link to Type checking and typability in domain-free lambda calculi (Q655411):
Displaying 5 items.
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- (Q3024919) (← links)
- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types (Q3557097) (← links)
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi (Q5020907) (← links)
- Checking Emptiness of Non-Deterministic Regular Types with Set Operators (Q5415619) (← links)