Java generics are turing complete
Saved in:
| Title: | Java generics are turing complete |
|---|---|
| Authors: | Grigore, Radu |
| Source: | ACM SIGPLAN Notices ; volume 52, issue 1, page 73-85 ; ISSN 0362-1340 1558-1160 |
| Publisher Information: | Association for Computing Machinery (ACM) |
| Publication Year: | 2017 |
| Description: | This paper describes a reduction from the halting problem of Turing machines to subtype checking in Java. It follows that subtype checking in Java is undecidable, which answers a question posed by Kennedy and Pierce in 2007. It also follows that Java's type checker can recognize any recursive language, which improves a result of Gill and Levy from 2016. The latter point is illustrated by a parser generator for fluent interfaces. |
| Document Type: | article in journal/newspaper |
| Language: | English |
| DOI: | 10.1145/3093333.3009871 |
| Availability: | https://doi.org/10.1145/3093333.3009871 https://dl.acm.org/doi/10.1145/3093333.3009871 https://dl.acm.org/doi/pdf/10.1145/3093333.3009871 |
| Rights: | https://www.acm.org/publications/policies/copyright_policy#Background |
| Accession Number: | edsbas.DDED31EC |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | This paper describes a reduction from the halting problem of Turing machines to subtype checking in Java. It follows that subtype checking in Java is undecidable, which answers a question posed by Kennedy and Pierce in 2007. It also follows that Java's type checker can recognize any recursive language, which improves a result of Gill and Levy from 2016. The latter point is illustrated by a parser generator for fluent interfaces. |
|---|---|
| DOI: | 10.1145/3093333.3009871 |