{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:44Z","timestamp":1750306784278,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,26]],"date-time":"2013-10-26T00:00:00Z","timestamp":1382745600000},"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,10,26]]},"DOI":"10.1145\/2508075.2527300","type":"proceedings-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T15:29:17Z","timestamp":1382542157000},"page":"101-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The poor man's proof assistant"],"prefix":"10.1145","author":[{"given":"Joey","family":"Eremondi","sequence":"first","affiliation":[{"name":"University of Saskatchewan, Saskatoon, SK, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-008-0110-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00433-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.04.016"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_11"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2269326"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55481-0"},{"key":"e_1_3_2_1_7_1","volume-title":"A Partial Characterization of the Shuffle Inclusion Problem onWords. Manuscript in preparation","author":"Eremondi J.","year":"2013","unstructured":"J. Eremondi and I. McQuillan . A Partial Characterization of the Shuffle Inclusion Problem onWords. Manuscript in preparation , 2013 . J. Eremondi and I. McQuillan. A Partial Characterization of the Shuffle Inclusion Problem onWords. Manuscript in preparation, 2013."},{"issue":"11","key":"e_1_3_2_1_8_1","first-page":"1382","article-title":"Formal proof the four-color theorem","volume":"55","author":"Gonthier G.","year":"2008","unstructured":"G. Gonthier . Formal proof the four-color theorem . Notices of the AMS , 55 ( 11 ): 1382 -- 1393 , 2008 . G. Gonthier. Formal proof the four-color theorem. Notices of the AMS, 55(11):1382--1393, 2008.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to HOL: a theorem proving environment for higher order logic","author":"Gordon M. J. C.","year":"1993","unstructured":"M. J. C. Gordon and T. F. Melham , editors . Introduction to HOL: a theorem proving environment for higher order logic . Cambridge University Press , New York, NY, USA , 1993 . ISBN 0-521-44189-7. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, New York, NY, USA, 1993. ISBN 0-521-44189-7."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00163-1"},{"key":"e_1_3_2_1_11_1","first-page":"632","volume-title":"Kodkod: A relational model finder. Tools and Algorithms for the Construction and","author":"Torlak E.","year":"2007","unstructured":"E. Torlak and D. Jackson . Kodkod: A relational model finder. Tools and Algorithms for the Construction and ..., pages 632 -- 647 , 2007 . E. Torlak and D. Jackson. Kodkod: A relational model finder. Tools and Algorithms for the Construction and ..., pages 632--647, 2007."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151954.1067536"}],"event":{"name":"SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Indianapolis Indiana USA","acronym":"SPLASH '13"},"container-title":["Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2508075.2527300","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2508075.2527300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:10Z","timestamp":1750232050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2508075.2527300"}},"subtitle":["using prolog to develop formal language theoretic proofs"],"short-title":[],"issued":{"date-parts":[[2013,10,26]]},"references-count":12,"alternative-id":["10.1145\/2508075.2527300","10.1145\/2508075"],"URL":"https:\/\/doi.org\/10.1145\/2508075.2527300","relation":{},"subject":[],"published":{"date-parts":[[2013,10,26]]},"assertion":[{"value":"2013-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}