{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T14:52:35Z","timestamp":1781275955898,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009871","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"73-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Java generics are turing complete"],"prefix":"10.1145","author":[{"given":"Radu","family":"Grigore","sequence":"first","affiliation":[{"name":"University of Kent, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984004"},{"key":"e_1_3_2_1_2_1","volume-title":"More Scala typehackery. https:\/\/apocalisp.wordpress.com\/2009\/09\/02\/ (see also https:\/\/michid.wordpress.com\/2010\/01\/29)","author":"Bjarnason R. O.","year":"2009","unstructured":"R. O. Bjarnason . More Scala typehackery. https:\/\/apocalisp.wordpress.com\/2009\/09\/02\/ (see also https:\/\/michid.wordpress.com\/2010\/01\/29) , 2009 . R. O. Bjarnason. More Scala typehackery. https:\/\/apocalisp.wordpress.com\/2009\/09\/02\/ (see also https:\/\/michid.wordpress.com\/2010\/01\/29), 2009."},{"key":"e_1_3_2_1_3_1","unstructured":"A. Breslav. Mixed-site variance in Kotlin. http:\/\/blog.jetbrains.com\/kotlin\/2013\/06\/mixed 2013.  A. Breslav. Mixed-site variance in Kotlin. http:\/\/blog.jetbrains.com\/kotlin\/2013\/06\/mixed 2013."},{"key":"e_1_3_2_1_4_1","volume-title":"Mathematical Systems Theory","author":"Courcelle B.","year":"1977","unstructured":"B. Courcelle . On jump-deterministic pushdown automata . Mathematical Systems Theory , 1977 . B. Courcelle. On jump-deterministic pushdown automata. Mathematical Systems Theory, 1977."},{"key":"e_1_3_2_1_5_1","volume-title":"http:\/\/boostorg.github.io\/hana","author":"Dionne L.","year":"2016","unstructured":"L. Dionne . Boost.Hana. http:\/\/boostorg.github.io\/hana , 2016 . L. Dionne. Boost.Hana. http:\/\/boostorg.github.io\/hana, 2016."},{"key":"e_1_3_2_1_6_1","volume-title":"ECOOP","author":"Gil Y.","year":"2016","unstructured":"Y. Gil and T. Levy . Formal language recognition with the Java type checker . In ECOOP , 2016 . Y. Gil and T. Levy. Formal language recognition with the Java type checker. In ECOOP, 2016."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106"},{"key":"e_1_3_2_1_8_1","volume-title":"The Java language specification","author":"Gosling J.","year":"2015","unstructured":"J. Gosling , B. Joy , G. Steele , G. Bracha , and A. Buckley . The Java language specification , 2015 . Java SE 8 Edition. B. Greenman, F. Muehlboeck, and R. Tate. Getting F-bounded polymorphism into shape. In PLDI , 2014. J. Gosling, B. Joy, G. Steele, G. Bracha, and A. Buckley. The Java language specification, 2015. Java SE 8 Edition. B. Greenman, F. Muehlboeck, and R. Tate. Getting F-bounded polymorphism into shape. In PLDI, 2014."},{"key":"e_1_3_2_1_9_1","volume-title":"http:\/\/rgrig.appspot.com\/javats","author":"Grigore R.","year":"2016","unstructured":"R. Grigore . Parser generator for fluent interfaces. http:\/\/rgrig.appspot.com\/javats , 2016 . R. Grigore. Parser generator for fluent interfaces. http:\/\/rgrig.appspot.com\/javats, 2016."},{"key":"e_1_3_2_1_10_1","volume-title":"Introduction to Automata Theory, Languages, and Computation. Addison\u2013Wesley","author":"Hopcroft J. E.","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman . Introduction to Automata Theory, Languages, and Computation. Addison\u2013Wesley , 1979 . J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison\u2013Wesley, 1979."},{"key":"e_1_3_2_1_11_1","volume-title":"FOOL","author":"Kennedy A. J.","year":"2007","unstructured":"A. J. Kennedy and B. Pierce . On decidability of nominal subtyping with variance . In FOOL , 2007 . A. J. Kennedy and B. Pierce. On decidability of nominal subtyping with variance. In FOOL, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90426-2"},{"key":"e_1_3_2_1_13_1","volume-title":"Informatica Didactica","author":"Lange M.","year":"2009","unstructured":"M. Lange and H. Lei\u00df . To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm . Informatica Didactica , 2009 . M. Lange and H. Lei\u00df. To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm. Informatica Didactica, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_16_1","volume-title":"Theoretical Computer Science Stack Exchange, 2013","author":"Lippert E.","year":"1886","unstructured":"E. Lippert . A simple problem whose decidability is not known . Theoretical Computer Science Stack Exchange, 2013 . http:\/\/cstheory.stackexchange.com\/q\/ 1886 6. E. Lippert. A simple problem whose decidability is not known. Theoretical Computer Science Stack Exchange, 2013. http:\/\/cstheory.stackexchange.com\/q\/18866."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96748"},{"key":"e_1_3_2_1_18_1","unstructured":"M. Odersky. Scaling DOT to Scala \u2013 soundness. http:\/\/scala-lang. org\/blog\/2016\/02\/17\/scaling-dot-soundness.html 2016.  M. Odersky. Scaling DOT to Scala \u2013 soundness. http:\/\/scala-lang. org\/blog\/2016\/02\/17\/scaling-dot-soundness.html 2016."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1055"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796806006137"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993570"},{"key":"e_1_3_2_1_22_1","volume-title":"On computable numbers, with an application to the Entscheidungsproblem. J. of Math","author":"Turing A. M.","year":"1936","unstructured":"A. M. Turing . On computable numbers, with an application to the Entscheidungsproblem. J. of Math , 1936 . A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. J. of Math, 1936."},{"key":"e_1_3_2_1_23_1","volume-title":"Technical report","author":"Veldhuizen T. L.","year":"2003","unstructured":"T. L. Veldhuizen . C++ templates are Turing complete. Technical report , Indiana University , 2003 . T. L. Veldhuizen. C++ templates are Turing complete. Technical report, Indiana University, 2003."},{"key":"e_1_3_2_1_24_1","volume-title":"On the recursive generation of parametric types. Technical report","author":"Viroli M.","year":"2000","unstructured":"M. Viroli . On the recursive generation of parametric types. Technical report , University of Bologna , 2000 . M. Viroli. On the recursive generation of parametric types. Technical report, University of Bologna, 2000."},{"key":"e_1_3_2_1_25_1","unstructured":"K. Wansbrough. Instance declarations are universal. http:\/\/www.lochan.org\/keith\/publications\/undec.html (see also https:\/\/wiki.haskell.org\/Type_SK) 1998.  K. Wansbrough. Instance declarations are universal. http:\/\/www.lochan.org\/keith\/publications\/undec.html (see also https:\/\/wiki.haskell.org\/Type_SK) 1998."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_10"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159842.1159844"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00047-5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738008"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009871","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:05:33Z","timestamp":1750259133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":28,"alternative-id":["10.1145\/3009837.3009871","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009871","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009871","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}