{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:00Z","timestamp":1750307520794,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,9,7]],"date-time":"2009-09-07T00:00:00Z","timestamp":1252281600000},"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":[[2009,9,7]]},"DOI":"10.1145\/1599410.1599424","type":"proceedings-article","created":{"date-parts":[[2009,9,8]],"date-time":"2009-09-08T12:53:09Z","timestamp":1252414389000},"page":"105-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Making induction manifest in modular ACL2"],"prefix":"10.1145","author":[{"given":"Carl","family":"Eastlund","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,9,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/10930755_18"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1017\/S0956796806005867"},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Proc. 8th Workshop on Scheme and Functional Programming","author":"Culpepper R.","year":"2007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1411204.1411248"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-540-92995-6_4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/BF00881906"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1017\/S0956796801004208"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/581478.581486"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/277650.277730"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/174675.176927"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.5555\/646526.694884"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/555902"},{"volume-title":"Kluwer Academic Publishers","year":"2000","author":"Kaufmann M.","key":"e_1_3_2_1_13_1"},{"unstructured":"Kaufmann M. and J.S. Moore. A precise description of the ACL2 logic. Technical report University of Texas at Austin 1998.  Kaufmann M. and J.S. Moore. A precise description of the ACL2 logic. Technical report University of Texas at Austin 1998.","key":"e_1_3_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1023\/A:1026517200045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/174675.176926"},{"key":"e_1_3_2_1_17_1","first-page":"188","volume-title":"Proc. 3rd International Workshop on the ACL2 Theorem Prover and its Applications","author":"Mart\u00edn-Mateos F.J.","year":"2002"},{"volume-title":"MIT Press","year":"1990","author":"Milner R.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1159803.1159815"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/319838.319850"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1017\/S095679680700634X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1411260.1411264"},{"key":"e_1_3_2_1_23_1","first-page":"99","volume-title":"Proc. 3rd BCS\/FACS Workshop on Refinement","author":"Sannella D.","year":"1991"},{"volume-title":"Digital Press","year":"1984","author":"Steele G.L.","key":"e_1_3_2_1_24_1"},{"unstructured":"The Coq Development Team. The Coq Proof Assistant Reference Manual 2009. http:\/\/coq.inria.fr\/coq\/distrib\/current\/refman\/.  The Coq Development Team. The Coq Proof Assistant Reference Manual 2009. http:\/\/coq.inria.fr\/coq\/distrib\/current\/refman\/.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1217975.1217999"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.5555\/1097041"}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"acronym":"PPDP '09","name":"PPDP '09: Principles and Practice of Declarative Programming","location":"Coimbra Portugal"},"container-title":["Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1599410.1599424","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1599410.1599424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:15Z","timestamp":1750249095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1599410.1599424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,7]]},"references-count":27,"alternative-id":["10.1145\/1599410.1599424","10.1145\/1599410"],"URL":"https:\/\/doi.org\/10.1145\/1599410.1599424","relation":{},"subject":[],"published":{"date-parts":[[2009,9,7]]},"assertion":[{"value":"2009-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}