{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:34Z","timestamp":1772164054413,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"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":[[2016,11]]},"DOI":"10.1145\/2989225.2989230","type":"proceedings-article","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T10:16:42Z","timestamp":1477045002000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A small embedding of logic programming with a simple complete search"],"prefix":"10.1145","author":[{"given":"Jason","family":"Hemann","sequence":"first","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"William E.","family":"Byrd","sequence":"additional","affiliation":[{"name":"University of Utah, USA"}]},{"given":"Matthew","family":"Might","sequence":"additional","affiliation":[{"name":"University of Utah, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"532","volume-title":"Handbook of Automated Reasoning","author":"Baader Franz","unstructured":"Franz Baader and Wayne Snyder . Unification theory . In John Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning , pages 445\u2013 532 . Elsevier and MIT Press, 2001. Franz Baader and Wayne Snyder. Unification theory. In John Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, pages 445\u2013532. Elsevier and MIT Press, 2001."},{"key":"e_1_3_2_1_2_1","volume-title":"Logic Programming: A Classified Bibliography","author":"Balbin Isaac","year":"2012","unstructured":"Isaac Balbin and Koenraad Lecot . Logic Programming: A Classified Bibliography . Springer Science & amp; Business Media, 2012 . Isaac Balbin and Koenraad Lecot. Logic Programming: A Classified Bibliography. Springer Science & Business Media, 2012."},{"key":"e_1_3_2_1_3_1","first-page":"73","volume-title":"Programming of Future Generation Computers","author":"Billaud Michel","unstructured":"Michel Billaud . Prolog Control Structures: a Formalization and its Applications . In K. Fuhi and M. Nivat, editors, Programming of Future Generation Computers , pages 57\u2013 73 . Elsevier Science Publishers, 1988. Michel Billaud. Prolog Control Structures: a Formalization and its Applications. In K. Fuhi and M. Nivat, editors, Programming of Future Generation Computers, pages 57\u201373. Elsevier Science Publishers, 1988."},{"key":"e_1_3_2_1_4_1","first-page":"90","volume-title":"Scheme 8","author":"Byrd William E.","year":"2007","unstructured":"William E. Byrd and Daniel P. Friedman . \u03b1Kanren: A Fresh Name in Nominal Logic Programming . In Scheme 8 , pages 79\u2013 90 (see also http:\/\/webyrd.net\/alphamk\/alphamk.pdf for improvements ), 2007 . William E. Byrd and Daniel P. Friedman. \u03b1Kanren: A Fresh Name in Nominal Logic Programming. In Scheme 8, pages 79\u201390 (see also http:\/\/webyrd.net\/alphamk\/alphamk.pdf for improvements ), 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661103.2661105"},{"key":"e_1_3_2_1_6_1","volume-title":"General recursion via coinductive types. Logical Methods in Computer Science, 1(2)","author":"Capretta Venanzio","year":"2005","unstructured":"Venanzio Capretta . General recursion via coinductive types. Logical Methods in Computer Science, 1(2) , 2005 . Venanzio Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 1(2), 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037326"},{"key":"e_1_3_2_1_9_1","volume-title":"Projection in Constraint Logic Programming","author":"Fordan Andreas","year":"1999","unstructured":"Andreas Fordan . Projection in Constraint Logic Programming . Ios Press , 1999 . Andreas Fordan. Projection in Constraint Logic Programming. Ios Press, 1999."},{"key":"e_1_3_2_1_10_1","volume-title":"Friedman and Oleg Kiselyov. A declarative applicative logic programming system","author":"Daniel","year":"2005","unstructured":"Daniel P. Friedman and Oleg Kiselyov. A declarative applicative logic programming system , 2005 . Daniel P. Friedman and Oleg Kiselyov. A declarative applicative logic programming system, 2005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121583"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/317636.317779"},{"key":"e_1_3_2_1_13_1","first-page":"13","article-title":"\u00b5Kanren: A minimal functional core for relational programming","author":"Hemann Jason","year":"2013","unstructured":"Jason Hemann and Daniel P. Friedman . \u00b5Kanren: A minimal functional core for relational programming . In Scheme 13 , 2013 . Jason Hemann and Daniel P. Friedman. \u00b5Kanren: A minimal functional core for relational programming. In Scheme 13, 2013.","journal-title":"Scheme"},{"key":"e_1_3_2_1_14_1","first-page":"15","article-title":"A framework for extending microkanren with constraints","author":"Hemann Jason","year":"2015","unstructured":"Jason Hemann and Daniel P. Friedman . A framework for extending microkanren with constraints . In Scheme 15 , 2015 . Jason Hemann and Daniel P. Friedman. A framework for extending microkanren with constraints. In Scheme 15, 2015.","journal-title":"Scheme"},{"key":"e_1_3_2_1_15_1","unstructured":"Forthcoming.  Forthcoming."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/357766.351258"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054101000436"},{"key":"e_1_3_2_1_18_1","first-page":"995","volume-title":"Fifth Generation Computing Systems","author":"Jaffar Joxan","year":"1992","unstructured":"Joxan Jaffar , Michael J. Maher , Peter J. Stuckey , and Roland HC Yap . Output in CLP(R) . In Fifth Generation Computing Systems , pages 987\u2013 995 , 1992 . Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, and Roland HC Yap. Output in CLP(R). In Fifth Generation Computing Systems, pages 987\u2013995, 1992."},{"key":"e_1_3_2_1_19_1","volume-title":"The taste of logic programming","author":"Kiselyov Oleg","year":"2006","unstructured":"Oleg Kiselyov . The taste of logic programming , 2006 . Oleg Kiselyov. The taste of logic programming, 2006."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086390"},{"key":"e_1_3_2_1_21_1","first-page":"324","volume-title":"K. L. Clark et al.","author":"Komorowski H. J.","unstructured":"H. J. Komorowski . QLOG: The programming environment for PROLOG in LISP . In K. L. Clark et al. , editors, Logic Programming , pages 315\u2013 324 . Academic Press, 1982. H. J. Komorowski. QLOG: The programming environment for PROLOG in LISP. In K. L. Clark et al., editors, Logic Programming, pages 315\u2013324. Academic Press, 1982."},{"key":"e_1_3_2_1_22_1","volume-title":"North-Holland\/Elsevier","author":"Kowalski Robert A.","year":"1979","unstructured":"Robert A. Kowalski . Logic for Problem Solving . North-Holland\/Elsevier , 1979 . Robert A. Kowalski. Logic for Problem Solving. North-Holland\/Elsevier, 1979."},{"key":"e_1_3_2_1_23_1","volume-title":"Mechanising Aspects of miniKanren in HOL","author":"Kumar Ramana","year":"2010","unstructured":"Ramana Kumar . Mechanising Aspects of miniKanren in HOL , 2010 . Australian National University . Bachelors thesis. Ramana Kumar. Mechanising Aspects of miniKanren in HOL, 2010. Australian National University. Bachelors thesis."},{"key":"e_1_3_2_1_25_1","unstructured":"Joseph P. Near William E. Byrd and Daniel P. Friedman. \u03b1leanTAP : A declarative theorem prover for first-order classical logic.  Joseph P. Near William E. Byrd and Daniel P. Friedman. \u03b1leanTAP : A declarative theorem prover for first-order classical logic."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321253"},{"key":"e_1_3_2_1_28_1","volume-title":"Scheme Request for Implementation. SRFI-1","author":"Shivers Olin","year":"1999","unstructured":"Olin Shivers . List Library . Scheme Request for Implementation. SRFI-1 , 1999 . Olin Shivers. List Library. Scheme Request for Implementation. SRFI-1, 1999."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/69558.69563"},{"key":"e_1_3_2_1_30_1","first-page":"99","article-title":"Embedding Prolog in Haskell. In E. Meier, editor","author":"Spivey JM","year":"1999","unstructured":"JM Spivey and Silvija Seres . Embedding Prolog in Haskell. In E. Meier, editor , Haskell 99 , 1999 . JM Spivey and Silvija Seres. Embedding Prolog in Haskell. In E. Meier, editor, Haskell 99, 1999.","journal-title":"Haskell"}],"event":{"name":"SPLASH '16: Conference on Systems, Programming, Languages, and Applications: Software for Humanity","location":"Amsterdam Netherlands","acronym":"SPLASH '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"]},"container-title":["Proceedings of the 12th Symposium on Dynamic Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2989225.2989230","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2989225.2989230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:23:06Z","timestamp":1750206186000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2989225.2989230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":27,"alternative-id":["10.1145\/2989225.2989230","10.1145\/2989225"],"URL":"https:\/\/doi.org\/10.1145\/2989225.2989230","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093334.2989230","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,11]]},"assertion":[{"value":"2016-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}