Pages that link to "Item:Q1134141"
From MaRDI portal
The following pages link to An extension of basic functionality theory for \(\lambda\)-calculus (Q1134141):
Displayed 19 items.
- The emptiness problem for intersection types (Q4934035) (← links)
- Refinement types for program analysis (Q5030192) (← links)
- (Q5076060) (← links)
- (Q5089030) (← links)
- (Q5089036) (← links)
- Type Inference for Rank 2 Gradual Intersection Types (Q5098736) (← links)
- (Q5111320) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- (Q5208874) (← links)
- Functional Type Assignment for Featherweight Java (Q5410450) (← links)
- Recursive Domain Equations of Filter Models (Q5448641) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Full abstraction for lambda calculus with resources and convergence testing (Q5878917) (← links)
- Strictness, totality, and non-standard-type inference (Q5958293) (← links)
- Type inference for rank-2 intersection types using set unification (Q6109501) (← links)
- The bang calculus revisited (Q6116183) (← links)
- A strong call-by-need calculus (Q6135746) (← links)
- Structural rules and algebraic properties of intersection types (Q6164466) (← links)
- Quantitative weak linearisation (Q6164467) (← links)