POPL 2017
Sun 15 - Sat 21 January 2017
Wed 18 Jan 2017 10:55 - 11:20 at Auditorium - Type Systems 1 Chair(s): Avik Chaudhuri

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.

Wed 18 Jan

POPL-2017-papers
10:30 - 12:10: POPL - Type Systems 1 at Auditorium
Chair(s): Avik Chaudhuri
POPL-2017-papers148473180000010:30 - 10:55
Talk
POPL-2017-papers148473330000010:55 - 11:20
Talk
POPL-2017-papers148473480000011:20 - 11:45
Talk
POPL-2017-papers148473630000011:45 - 12:10
Talk