{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:08Z","timestamp":1780994468173,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":21,"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"}],"funder":[{"DOI":"10.13039\/501100000727","name":"Trinity College, University of Cambridge","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000727","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009882","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"60-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Polymorphism, subtyping, and type inference in MLsub"],"prefix":"10.1145","author":[{"given":"Stephen","family":"Dolan","sequence":"first","affiliation":[{"name":"University of Cambridge, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Mycroft","sequence":"additional","affiliation":[{"name":"University of Cambridge, 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\/155183.155231"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","first-page":"55","volume-title":"Programming Languages and Their Definition","author":"Beki\u02c7c H.","unstructured":"H. Beki\u02c7c . Definable operations in general algebras, and the theory of automata and flowcharts . In C. Jones, editor, Programming Languages and Their Definition , volume 177 of Lecture Notes in Computer Science , pages 30\u2013 55 . Springer Berlin Heidelberg, 1984. H. Beki\u02c7c. Definable operations in general algebras, and the theory of automata and flowcharts. In C. Jones, editor, Programming Languages and Their Definition, volume 177 of Lecture Notes in Computer Science, pages 30\u201355. Springer Berlin Heidelberg, 1984."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263743"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034788"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"e_1_3_2_1_6_1","unstructured":"S. Dolan. Algebraic Subtyping. PhD thesis University of Cambridge 2016. To appear.  S. Dolan. Algebraic Subtyping. PhD thesis University of Cambridge 2016. To appear."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80008-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/217838.217858"},{"key":"e_1_3_2_1_9_1","first-page":"361","volume-title":"Logic in Computer Science, 1997. LICS\u201997. Proceedings., 12th Annual IEEE Symposium on","author":"Henglein F.","unstructured":"F. Henglein and J. Rehof . The complexity of subtype entailment for simple types . In Logic in Computer Science, 1997. LICS\u201997. Proceedings., 12th Annual IEEE Symposium on , pages 352\u2013 361 . IEEE, 1997. F. Henglein and J. Rehof. The complexity of subtype entailment for simple types. In Logic in Computer Science, 1997. LICS\u201997. Proceedings., 12th Annual IEEE Symposium on, pages 352\u2013361. IEEE, 1997."},{"key":"e_1_3_2_1_10_1","first-page":"627","volume-title":"25th International Colloquium on Automata, Languages and Programming, ICALP \u201998","author":"Henglein F.","unstructured":"F. Henglein and J. Rehof . Constraint automata and the complexity of recursive subtype entailment. In 25th International Colloquium on Automata, Languages and Programming, ICALP \u201998 , pages 616\u2013 627 . Springer Berlin Heidelberg, 1998. F. Henglein and J. Rehof. Constraint automata and the complexity of recursive subtype entailment. In 25th International Colloquium on Automata, Languages and Programming, ICALP \u201998, pages 616\u2013627. Springer Berlin Heidelberg, 1998."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199481"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","first-page":"124","volume-title":"Theory Is Forever","author":"Ilie L.","unstructured":"L. Ilie , G. Navarro , and S. Yu . On NFA reductions . In J. Karhum\u00e4ki, H. Maurer, G. P\u0103un, and G. Rozenberg, editors, Theory Is Forever , volume 3113 of Lecture Notes in Computer Science , pages 112\u2013 124 . Springer Berlin Heidelberg, 2004. L. Ilie, G. Navarro, and S. Yu. On NFA reductions. In J. Karhum\u00e4ki, H. Maurer, G. P\u0103un, and G. Rozenberg, editors, Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, pages 112\u2013124. Springer Berlin Heidelberg, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/141471.141540"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158700"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/357162.357169"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","first-page":"265","volume-title":"Advances in Computing Science \u2014 ASIAN\u201999","author":"Niehren J.","unstructured":"J. Niehren and T. Priesnitz . Entailment of non-structural subtype constraints . In P. Thiagarajan and R. Yap, editors, Advances in Computing Science \u2014 ASIAN\u201999 , volume 1742 of Lecture Notes in Computer Science , pages 251\u2013 265 . Springer Berlin Heidelberg, 1999. J. Niehren and T. Priesnitz. Entailment of non-structural subtype constraints. In P. Thiagarajan and R. Yap, editors, Advances in Computing Science \u2014 ASIAN\u201999, volume 1742 of Lecture Notes in Computer Science, pages 251\u2013265. Springer Berlin Heidelberg, 1999."},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","first-page":"384","volume-title":"Theoretical Aspects of Computer Software","author":"Niehren J.","unstructured":"J. Niehren and T. Priesnitz . Non-structural subtype entailment in automata theory . In N. Kobayashi and B. C. Pierce, editors, Theoretical Aspects of Computer Software , volume 2215 of Lecture Notes in Computer Science , pages 360\u2013 384 . Springer Berlin Heidelberg, 2001. J. Niehren and T. Priesnitz. Non-structural subtype entailment in automata theory. In N. Kobayashi and B. C. Pierce, editors, Theoretical Aspects of Computer Software, volume 2215 of Lecture Notes in Computer Science, pages 360\u2013384. Springer Berlin Heidelberg, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00020-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503292"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","first-page":"365","volume-title":"Static Analysis","author":"Trifonov V.","unstructured":"V. Trifonov and S. Smith . Subtyping constrained types . In R. Cousot and D. A. Schmidt, editors, Static Analysis , volume 1145 of Lecture Notes in Computer Science , pages 349\u2013 365 . Springer Berlin Heidelberg, 1996. V. Trifonov and S. Smith. Subtyping constrained types. In R. Cousot and D. A. Schmidt, editors, Static Analysis, volume 1145 of Lecture Notes in Computer Science, pages 349\u2013365. Springer Berlin Heidelberg, 1996."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"}],"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.3009882","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:05:34Z","timestamp":1750259134000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":21,"alternative-id":["10.1145\/3009837.3009882","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009882","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009882","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"}}]}}