{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:20Z","timestamp":1772163980740,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429073","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Full abstraction for nominal Scott domains"],"prefix":"10.1145","author":[{"given":"Steffen","family":"L\u00f6sch","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Pitts","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"URL http:\/\/www.citeulike.org\/group\/11951\/.  URL http:\/\/www.citeulike.org\/group\/11951\/."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90065-T"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021851"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_3_2_2_5_1","volume-title":"Handbook of Logic in Computer Science","author":"Abramsky S.","year":"1994","unstructured":"S. Abramsky and A. Jung . Domain theory . In Handbook of Logic in Computer Science , Volume 3 . Semantic Structures, chapter 1. Oxford University Press , 1994 . S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, Volume 3. Semantic Structures, chapter 1. Oxford University Press, 1994."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103704"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.48"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_12"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.10.007"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.011"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.11.013"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1305810911"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987171.1987202"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650200016"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8749-3"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_3_2_2_17_1","volume-title":"A Topos Theory Compendium, Volumes 1 and 2. Number 43--44 in Oxford Logic Guides","author":"Johnstone P. T.","year":"2002","unstructured":"P. T. Johnstone . Sketches of an Elephant , A Topos Theory Compendium, Volumes 1 and 2. Number 43--44 in Oxford Logic Guides . Oxford University Press , 2002 . P. T. Johnstone. Sketches of an Elephant, A Topos Theory Compendium, Volumes 1 and 2. Number 43--44 in Oxford Logic Guides. Oxford University Press, 2002."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2007.10.006"},{"key":"e_1_3_2_2_19_1","first-page":"396","volume-title":"Relating Two Semantics of Locally Scoped Names. In Proc. CSL 2011, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"L\u00f6sch S.","year":"2011","unstructured":"S. L\u00f6sch and A. M. Pitts . Relating Two Semantics of Locally Scoped Names. In Proc. CSL 2011, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs) , pages 396 -- 411 , 2011 . S. L\u00f6sch and A. M. Pitts. Relating Two Semantics of Locally Scoped Names. In Proc. CSL 2011, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 396--411, 2011."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02485815"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645729.668020"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_30"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.175187"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00138-X"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147961"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796811000116"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/648085.747303"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645722.666533"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.44"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646236.682867"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.06.003"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944729"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1212163"},{"key":"e_1_3_2_2_39_1","volume-title":"University of Cambridge","author":"Turner D. C.","year":"2009","unstructured":"D. C. Turner . Nominal Domain Theory for Concurrency. PhD thesis , University of Cambridge , 2009 . D. C. Turner. Nominal Domain Theory for Concurrency. PhD thesis, University of Cambridge, 2009."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1807662.1807704"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926420"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2012.02.002"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429073","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":38,"alternative-id":["10.1145\/2429069.2429073","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429073","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429073","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}