A computational complexity analysis of tunable type inference for Generic Universe Types (Q2304565)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7179881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational complexity analysis of tunable type inference for Generic Universe Types |
scientific article; zbMATH DE number 7179881 |
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
0.7240234017372131
0 references
0.6830392479896545
0 references
0.6727275848388672
0 references
