Pages that link to "Item:Q1884929"
From MaRDI portal
The following pages link to Principality and type inference for intersection types using expansion variables (Q1884929):
Displaying 21 items.
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Nominal essential intersection types (Q1643145) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
- Principality and type inference for intersection types using expansion variables (Q1884929) (← links)
- Principal types and unification for simple intersection type systems (Q1900315) (← links)
- Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
- Implementing compositional analysis using intersection types with expansion variables (Q2842841) (← links)
- On type inference in the intersection type discipline (Q2851085) (← links)
- Elaborating intersection and union types (Q2875228) (← links)
- Inhabitation of Low-Rank Intersection Types (Q3637206) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- (Q4580327) (← links)
- Principal Typing in a ∀Λ-Discipline (Q4835538) (← links)
- (Q5089030) (← links)
- Type Inference for Rank 2 Gradual Intersection Types (Q5098736) (← links)
- (Q5208874) (← links)
- Essential and relational models (Q5269000) (← links)
- Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) (Q6076174) (← links)