Pages that link to "Item:Q4934035"
From MaRDI portal
The following pages link to The emptiness problem for intersection types (Q4934035):
Displaying 15 items.
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- Pre-grammars and inhabitation for a subset of rank 2 intersection types (Q2333664) (← links)
- Finite Combinatory Logic with Intersection Types (Q3007665) (← links)
- Inhabitation of Low-Rank Intersection Types (Q3637206) (← links)
- Recognizability in the Simply Typed Lambda-Calculus (Q3638274) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- (Q4580327) (← links)
- (Q5089030) (← links)
- (Q5111320) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- (Q5208874) (← links)
- Essential and relational models (Q5269000) (← links)
- (Q5856410) (← links)
