{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T02:54:08Z","timestamp":1673060048535},"reference-count":27,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.234.10","type":"journal-article","created":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T07:41:39Z","timestamp":1483083699000},"page":"135-149","source":"Crossref","is-referenced-by-count":1,"title":["A Framework for Extending microKanren with Constraints"],"prefix":"10.4204","volume":"234","author":[{"given":"Jason","family":"Hemann","sequence":"first","affiliation":[{"name":"Indiana University"}]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[{"name":"Indiana University"}]}],"member":"2720","published-online":{"date-parts":[[2017,1,1]]},"reference":[{"key":"alvis2011minikanren","article-title":"cKanren: miniKanren with Constraints","author":"Alvis","year":"2011","journal-title":"Scheme Workshop 11"},{"key":"brassel2008declaring","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.entcs.2008.06.037","article-title":"Declaring Numbers","volume":"216","author":"Bra\u00dfel","year":"2008","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"alphamk","first-page":"79","article-title":"\u03b1Kanren: A Fresh Name in Nominal Logic Programming","volume-title":"Proceedings of Scheme Workshop 07, Universit\u00e9 Laval Technical Report DIUL-RT-0701","author":"Byrd","year":"2007"},{"key":"Byrd:2012:quines","doi-asserted-by":"publisher","DOI":"10.1145\/2661103.2661105","article-title":"miniKanren, live and untagged","volume-title":"Proceedings of Scheme Workshop 12","author":"Byrd","year":"2012"},{"key":"clark1978negation","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","article-title":"Negation as Failure","volume-title":"Logic and Data Bases","author":"Clark","year":"1978"},{"key":"comon1994constraints","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-1-4471-3227-1_9","article-title":"Constraints in Term Algebras (Short Survey)","volume-title":"Algebraic Methodology and Software Technology (AMAST'93)","author":"Comon","year":"1994"},{"issue":"4","key":"Comon1999","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1023\/A:1009868906501","article-title":"A Methodological View of Constraint Solving","volume":"4","author":"Comon","year":"1999","journal-title":"Constraints"},{"key":"Comon_2001","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45406-3_2","article-title":"Constraint Solving on Terms","volume-title":"Constraints in Computational Logics","author":"Comon","year":"2001"},{"key":"culpepper2010fortifying","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1017\/s0956796812000275","article-title":"Fortifying macros","volume":"22","author":"Culpepper","year":"2012","journal-title":"Journal of Functional Programming"},{"key":"fordan1999projection","volume-title":"Projection in Constraint Logic Programming","author":"Fordan","year":"1999"},{"key":"Fruhwirth_2009","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511609886","volume-title":"Constraint Handling Rules","author":"Fruhwirth","year":"2009"},{"key":"hemann2016small","doi-asserted-by":"publisher","DOI":"10.1145\/2989225.2989230","article-title":"A small embedding of logic programming with a simple complete search","volume-title":"Proceedings of DLS 16","author":"Hemann","year":"2016"},{"key":"hinze2000deriving","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351258","article-title":"Deriving backtracking monad transformers","volume-title":"Proceedings of ICFP 00","author":"Hinze","year":"2000"},{"issue":"02","key":"hinze2001prolog","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1142\/S0129054101000436","article-title":"Prolog's control constructs in a functional setting Axioms and implementation","volume":"12","author":"Hinze","year":"2001","journal-title":"International Journal of Foundations of Computer Science"},{"key":"le1990new","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/bfb0024181","article-title":"A new data structure for implementing extensions to Prolog","volume-title":"Programming Language Implementation and Logic Programming","author":"Huitouze","year":"1990"},{"key":"jaffar87constraint","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41635","article-title":"Constraint logic programming","volume-title":"Proceedings of POPL 87","author":"Jaffar","year":"1987"},{"key":"jaffar1998semantics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/s0743-1066(98)10002-x","article-title":"The semantics of constraint logic programs","volume":"37","author":"Jaffar","year":"1998","journal-title":"The Journal of Logic Programming"},{"key":"jaffar1994constraint","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: a survey","volume":"19-20","author":"Jaffar","year":"1994","journal-title":"The Journal of Logic Programming"},{"key":"jaffar1993projecting","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/bf03037187","article-title":"Projecting CLP(R) constraints","volume":"11","author":"Jaffar","year":"1993","journal-title":"New Gener Comput"},{"key":"mkmacro","first-page":"37","article-title":"A Pattern-matcher for miniKanren -or- How to Get into Trouble with CPS Macros","volume-title":"Proceedings of Scheme Workshop 09, Cal Poly Technical Report CPSLO-CSC-09-03","author":"Keep","year":"2009"},{"key":"kiselyov2008pure","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-78969-7_7","article-title":"Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)","volume-title":"Functional and Logic Programming","author":"Kiselyov"},{"key":"kiselyov2005backtracking","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/1086365.1086390","article-title":"Backtracking, interleaving, and terminating monad transformers: (functional pearl)","volume-title":"Proceedings of ICFP 05","volume":"40","author":"Kiselyov","year":"2005"},{"key":"lloyd1991partial","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-m","article-title":"Partial evaluation in logic programming","volume":"11","author":"Lloyd","year":"1991","journal-title":"The Journal of Logic Programming"},{"key":"Maher93alogic","first-page":"737","article-title":"A Logic Programming View of CLP","volume-title":"Proceedings of ICLP 93","author":"Maher","year":"1993"},{"key":"alphatap","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-89982-2_26","article-title":"\\voidb@x \u03b1leanT-.1667em-.1667emA-.1667emP: A Declarative Theorem Prover for First-Order Classical Logic","volume-title":"Proceedings of ICLP 08","author":"Near","year":"2008"},{"issue":"06","key":"schrijvers2009monadic","doi-asserted-by":"publisher","DOI":"10.1017\/s0956796809990086","article-title":"Monadic constraint programming","volume":"19","author":"Schrijvers","year":"2009","journal-title":"Journal of Functional Programming"},{"key":"spivey1999embedding","article-title":"Embedding Prolog in Haskell","volume-title":"Proceedings of Haskell Workshop 99, Utrecht University Technical Report UU-CS-1999-28","author":"Spivey","year":"1999"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2017,1,4]],"date-time":"2017-01-04T08:42:34Z","timestamp":1483519354000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1701.00633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,1]]},"references-count":27,"URL":"https:\/\/doi.org\/10.4204\/eptcs.234.10","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,1]]}}}