{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:35Z","timestamp":1772163995771,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T00:00:00Z","timestamp":1327449600000},"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":[[2012,1,25]]},"DOI":"10.1145\/2103656.2103686","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T11:47:19Z","timestamp":1327405639000},"page":"231-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Nested refinements"],"prefix":"10.1145","author":[{"given":"Ravi","family":"Chugh","sequence":"first","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Patrick M.","family":"Rondon","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]},{"given":"Ranjit","family":"Jhala","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75296"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926437"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11531142_19"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2008.27"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive theorem proving and program development. coq'art: The calculus of inductive constructions","author":"Bertot Y.","year":"2004","unstructured":"Y. Bertot and P. Cast\u00e9ran . Interactive theorem proving and program development. coq'art: The calculus of inductive constructions , 2004 . Y. Bertot and P. Cast\u00e9ran. Interactive theorem proving and program development. coq'art: The calculus of inductive constructions, 2004."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863560"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_28"},{"key":"e_1_3_2_2_8_1","unstructured":"R. Chugh P. M. Rondon and R. Jhala. Nested refinements: A logic for duck typing. http:\/\/arxiv.org\/abs\/1103.5055v2.  R. Chugh P. M. Rondon and R. Jhala. Nested refinements: A logic for duck typing. http:\/\/arxiv.org\/abs\/1103.5055v2."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542483"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480921"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2009.5351142"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581484"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111059"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529700"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987211.1987225"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1883978.1883992"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946284.1946302"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763507.1763564"},{"key":"e_1_3_2_2_22_1","volume-title":"FOOL-WOOD","author":"Kennedy A. J.","year":"2007","unstructured":"A. J. Kennedy and B. C. Pierce . On decidability of nominal subtyping with variance . In FOOL-WOOD , 2007 . A. J. Kennedy and B. C. Pierce. On decidability of nominal subtyping with variance. In FOOL-WOOD, 2007."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667048.1667051"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_11"},{"key":"e_1_3_2_2_25_1","first-page":"21","volume-title":"In IFIP Congress","author":"McCarthy J.","year":"1962","unstructured":"J. McCarthy . Towards a mathematical science of computation . In In IFIP Congress , pages 21 -- 28 . North-Holland , 1962 . J. McCarthy. Towards a mathematical science of computation. In In IFIP Congress, pages 21--28. North-Holland, 1962."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/357073.357079"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_34"},{"key":"e_1_3_2_2_28_1","volume-title":"OO Type Systems","author":"Palsberg J.","year":"1994","unstructured":"J. Palsberg and M. I. Schwartzbach . OO Type Systems . Wiley , 1994 . J. Palsberg and M. I. Schwartzbach. OO Type Systems. Wiley, 1994."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268967"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75284"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375602"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706316"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422.322411"},{"key":"e_1_3_2_2_34_1","volume-title":"Scheme and Functional Programming Workshop","author":"Siek J.","year":"2006","unstructured":"J. Siek and W. Taha . Gradual typing for functional languages . In Scheme and Functional Programming Workshop , 2006 . J. Siek and W. Taha. Gradual typing for functional languages. In Scheme and Functional Programming Workshop, 2006."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_28"},{"key":"e_1_3_2_2_36_1","unstructured":"The Dojo Foundation. Dojo toolkit. http:\/\/dojotoolkit.org\/.  The Dojo Foundation. Dojo toolkit. http:\/\/dojotoolkit.org\/."},{"key":"e_1_3_2_2_37_1","unstructured":"}python-32The Python Software Foundation. Python 3.2 standard library. http:\/\/python.org\/.  }python-32The Python Software Foundation. Python 3.2 standard library. http:\/\/python.org\/."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_28"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863561"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292560"},{"key":"e_1_3_2_2_41_1","volume-title":"FOOL","author":"Zhao T.","year":"2010","unstructured":"T. Zhao . Type inference for scripting languages with implicit extension . In FOOL , 2010 . T. Zhao. Type inference for scripting languages with implicit extension. In FOOL, 2010."}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Philadelphia PA USA","acronym":"POPL '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103656.2103686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103656.2103686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:06:21Z","timestamp":1750226781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103656.2103686"}},"subtitle":["a logic for duck typing"],"short-title":[],"issued":{"date-parts":[[2012,1,25]]},"references-count":39,"alternative-id":["10.1145\/2103656.2103686","10.1145\/2103656"],"URL":"https:\/\/doi.org\/10.1145\/2103656.2103686","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2103621.2103686","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,1,25]]},"assertion":[{"value":"2012-01-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}