Pages that link to "Item:Q4764610"
From MaRDI portal
The following pages link to The complexity of type inference for higher-order typed lambda calculi (Q4764610):
Displaying 12 items.
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- (Q3024919) (← links)
- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types (Q3557097) (← links)
- Non finitely generated types and λ-terms combinatoric representation cost (Q4522149) (← links)
- Execution time of λ-terms via denotational semantics and intersection types (Q4577984) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them (Q4911148) (← links)
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi (Q5020907) (← links)
