{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:53Z","timestamp":1750306733039,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T00:00:00Z","timestamp":1413244800000},"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":[[2014,10,14]]},"DOI":"10.1145\/2661136.2661142","type":"proceedings-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T12:29:24Z","timestamp":1413289764000},"page":"163-171","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["It's Only Illegal If You Get Caught"],"prefix":"10.1145","author":[{"given":"Rapha\u00ebl","family":"Proust","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Alan","family":"Mycroft","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2014,10,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Haskell standard library modules. http:\/\/www.haskell.org\/ghc\/docs\/latest\/html\/libraries\/base\/.  Haskell standard library modules. http:\/\/www.haskell.org\/ghc\/docs\/latest\/html\/libraries\/base\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Ocaml Obj documentation. http:\/\/caml.inria.fr\/pub\/docs\/manual-ocaml\/libref\/Obj.html.  Ocaml Obj documentation. http:\/\/caml.inria.fr\/pub\/docs\/manual-ocaml\/libref\/Obj.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Ocaml: What you gain. http:\/\/roscidus.com\/blog\/blog\/2014\/02\/13\/ocaml-what-you-gain\/#immutability.  Ocaml: What you gain. http:\/\/roscidus.com\/blog\/blog\/2014\/02\/13\/ocaml-what-you-gain\/#immutability."},{"key":"e_1_3_2_1_4_1","unstructured":"Rust unsafe constructs. http:\/\/static.rust-lang.org\/doc\/0.9\/rust.html#unsafety.  Rust unsafe constructs. http:\/\/static.rust-lang.org\/doc\/0.9\/rust.html#unsafety."},{"key":"e_1_3_2_1_5_1","unstructured":"Writing an LLVM Pass. http:\/\/llvm.org\/docs\/WritingAnLLVMPass.html#specifying-interactions-between-passes.  Writing an LLVM Pass. http:\/\/llvm.org\/docs\/WritingAnLLVMPass.html#specifying-interactions-between-passes."},{"volume-title":"Imperial College London","year":"2012","author":"Gudka K.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378704.1378725"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Jouvelot P. and Gifford D. K. Algebraic reconstruction of types and effects 1991.  Jouvelot P. and Gifford D. K. Algebraic reconstruction of types and effects 1991.","DOI":"10.1145\/99583.99623"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24851-4_22"},{"key":"e_1_3_2_1_10_1","unstructured":"Marlow S. Haskell 2010 language report. http:\/\/www.haskell.org\/definition\/haskell2010.pdf.  Marlow S. Haskell 2010 language report. http:\/\/www.haskell.org\/definition\/haskell2010.pdf."}],"event":{"name":"SPLASH '14: Conference on Systems, Programming, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"],"location":"Portland Oregon USA","acronym":"SPLASH '14"},"container-title":["Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661136.2661142","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2661136.2661142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:46Z","timestamp":1750231186000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661136.2661142"}},"subtitle":["Breaking Invariants and Getting Away with It"],"short-title":[],"issued":{"date-parts":[[2014,10,14]]},"references-count":10,"alternative-id":["10.1145\/2661136.2661142","10.1145\/2661136"],"URL":"https:\/\/doi.org\/10.1145\/2661136.2661142","relation":{},"subject":[],"published":{"date-parts":[[2014,10,14]]},"assertion":[{"value":"2014-10-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}