A computational complexity analysis of tunable type inference for Generic Universe Types (Q2304565)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational complexity analysis of tunable type inference for Generic Universe Types |
scientific article |
Statements
A computational complexity analysis of tunable type inference for Generic Universe Types (English)
0 references
12 March 2020
0 references
computational complexity
0 references
programming languages
0 references
Java
0 references
type inference
0 references
type systems
0 references
object ownership
0 references
NP-hardness
0 references
