Java generics are turing complete
- Submitting institution
-
The University of Kent
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9520
- Type
- E - Conference contribution
- DOI
-
10.1145/3009837.3009871
- Title of conference / published proceedings
- Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
- First page
- 73
- Volume
- -
- Issue
- -
- ISSN
- 0362-1340
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2017
- URL
-
https://kar.kent.ac.uk/58183/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- 5
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is significant because it solves an open problem posed in 2007 by Andrew Kennedy (who helped design .NET generics) and Benjamin Pierce (who wrote the most widely used textbook on types). The main result shows that Java typecheckers cannot always terminate with a correct result, which has influenced discussions about the future evolution of the Java language. A secondary result shows that fluent APIs (where method calls are chained together) can be automatically generated, and subsequent work by others builds on this.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -