{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T02:33:23Z","timestamp":1774838003174,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"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":[[2008,9,20]]},"DOI":"10.1145\/1411204.1411237","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T09:39:01Z","timestamp":1222162741000},"page":"229-240","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":110,"title":["Ynot"],"prefix":"10.1145","author":[{"given":"Aleksandar","family":"Nanevski","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Greg","family":"Morrisett","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Avraham","family":"Shinnar","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Paul","family":"Govereau","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[{"name":"IT University of Copenhagen, Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/551462"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30569-9_3"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004099"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273920.1273922"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760037.1760047"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770203.1770209"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2932433.2932497"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762174.1762221"},{"key":"e_1_3_2_2_9_1","volume-title":"Calculemus'05","author":"Cruz-Filipe L.","year":"2005","unstructured":"L. Cruz-Filipe and P. Letouzey. A Large-Scale Experiment in Executing Extracted Programs. In Calculemus'05, 2005."},{"key":"e_1_3_2_2_10_1","unstructured":"D. L. Detlefs K. R. M. Leino G. Nelson and J. B. Saxe. Extended static checking. Compaq Systems Research Center Research Report 159 December 1998."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375603"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680200446X"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111059"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244400"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/319838.319848"},{"key":"e_1_3_2_2_17_1","volume-title":"http:\/\/research.microsoft.com\/~gonthier\/4colproof.pdf","author":"Gonthier G.","year":"2005","unstructured":"G. Gonthier. A computer-checked proof of the Four Colour Theorem. http:\/\/research.microsoft.com\/~gonthier\/4colproof.pdf, 2005."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792914"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/38.2.131"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.5"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647057.713871"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053580"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","unstructured":"T. Kleymann. Metatheory of verification calculi in LEGO: To what extent does syntax matter? In Types for Proofs and Programs volume 1657 of Lecture Notes in Computer Science pages 133--149 1999.","DOI":"10.5555\/646538.696013"},{"key":"e_1_3_2_2_24_1","volume-title":"FTFJP 2007 workshop","author":"Krishnaswami N. R.","year":"2007","unstructured":"N. R. Krishnaswami, L. Birkedal, and J. Aldrich. Modular verification of the subject-observer pattern via higher-order separation logic. Presented at the FTFJP 2007 workshop, 2007."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/570886.570888"},{"key":"e_1_3_2_2_26_1","volume-title":"ESC\/Java User's Manual","author":"Leino K. R. M.","year":"2000","unstructured":"K. R. M. Leino, G. Nelson, and J. B. Saxe. ESC\/Java User's Manual. Compaq Systems Research Center, October 2000. Technical Note 2000-002."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111042"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762639.1762651"},{"key":"e_1_3_2_2_29_1","volume-title":"JSSST Workshop on Programming and Programming Languages (PPL'07)","author":"Marti N.","year":"2007","unstructured":"N. Marti and R. Affeldt. A certified verifier for a fragment of Separation logic. In JSSST Workshop on Programming and Programming Languages (PPL'07). Japan Society for Software Science and Technology, 2007."},{"key":"e_1_3_2_2_30_1","volume-title":"LogiCal Project","author":"The","year":"2004","unstructured":"The Coq development team. The Coq proof assistant reference manual. LogiCal Project, 2004. Version 8.0."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/77350.77353"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762174.1762194"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159812"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263712"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111066"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/647851.737404"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964024"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792913"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11813040_34"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375602"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1053468.1053469"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028664.1028711"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291156"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291201.1291206"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.10.022"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289429"},{"key":"e_1_3_2_2_47_1","series-title":"LNCS","first-page":"250","volume-title":"Proceedings of CSL'04","author":"Weber T.","year":"2004","unstructured":"T. Weber. Towards mechanized program verification with separation logic. In Proceedings of CSL'04, volume 3210 of LNCS, pages 250--264. Springer, 2004."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086400"},{"key":"e_1_3_2_2_49_1","volume-title":"Technische Universit\u00e4t M\u00fcnchen","author":"Wildmoser M.","year":"2005","unstructured":"M. Wildmoser. Verified Proof Carrying Code. PhD thesis, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, 2005."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30142-4_22"},{"key":"e_1_3_2_2_51_1","first-page":"394","volume-title":"TYPES'03","author":"Applied Type H. Xi.","year":"2004","unstructured":"H. Xi. Applied Type System (extended abstract). In TYPES'03, pages 394--408. Springer-Verlag LNCS 3085, 2004."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277732"}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","location":"Victoria BC Canada","acronym":"ICFP08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 13th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411204.1411237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T16:40:42Z","timestamp":1755189642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411237"}},"subtitle":["dependent types for imperative programs"],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":52,"alternative-id":["10.1145\/1411204.1411237","10.1145\/1411204"],"URL":"https:\/\/doi.org\/10.1145\/1411204.1411237","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1411203.1411237","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,9,20]]},"assertion":[{"value":"2008-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}