{"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":1772163980682,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,9]],"date-time":"2012-09-09T00:00:00Z","timestamp":1347148800000},"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,9,9]]},"DOI":"10.1145\/2364527.2364532","type":"proceedings-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T09:01:27Z","timestamp":1347440487000},"page":"15-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Formal verification of monad transformers"],"prefix":"10.1145","author":[{"given":"Brian","family":"Huffman","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2012,9,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Amadio and Pierre-Louis Curien. Domains and Lambda-Calculi","author":"Roberto","year":"1998"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_19"},{"key":"e_1_3_2_1_4_1","volume-title":"Archive of Formal Proofs","author":"Huffman Brian","year":"2012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11541868_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647698.734150"},{"key":"e_1_3_2_1_7_1","unstructured":"Olaf M\u00fcller Tobias Nipkow David von Oheimb and Oskar Slotosch. HOLCF = HOL  Olaf M\u00fcller Tobias Nipkow David von Oheimb and Oskar Slotosch. HOLCF = HOL"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679689900341X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Tobias\n      Nipkow Lawrence C.\n      Paulson and \n      Markus\n      Wenzel\n    . Isabelle\/\n      HOL -- A\n      Proof\n      Assistant\n       for \n      Higher-Order Logic volume \n  2283\n   of \n  LNCS\n  . \n  Springer 2002\n  .   Tobias Nipkow Lawrence C. Paulson and Markus Wenzel. Isabelle\/HOL -- A Proof Assistant for Higher-Order Logic volume 2283 of LNCS. Springer 2002.","DOI":"10.1007\/3-540-45949-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71067-7_23"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"}],"event":{"name":"ICFP'12: ACM SIGPLAN International Conference on Functional Programming","location":"Copenhagen Denmark","acronym":"ICFP'12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 17th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2364527.2364532","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2364527.2364532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:34:00Z","timestamp":1750224840000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2364527.2364532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,9]]},"references-count":10,"alternative-id":["10.1145\/2364527.2364532","10.1145\/2364527"],"URL":"https:\/\/doi.org\/10.1145\/2364527.2364532","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2398856.2364532","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,9,9]]},"assertion":[{"value":"2012-09-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}