Claire E. Alvis, Jeremiah J. Willcock, Kyle M. Carter, William E. Byrd & Daniel P. Friedman (2011):
cKanren: miniKanren with Constraints.
Scheme Workshop 11.
Bernd Braßel, Sebastian Fischer & Frank Huch (2008):
Declaring Numbers.
Electronic Notes in Theoretical Computer Science 216,
pp. 111–124.
Available at http://dx.doi.org/10.1016/j.entcs.2008.06.037.
William E. Byrd & Daniel P. Friedman (2007):
αKanren: A Fresh Name in Nominal Logic Programming.
In: Proceedings of Scheme Workshop 07, Université Laval Technical Report DIUL-RT-0701,
pp. 79–90 (see also \voidb@x http://webyrd.net/alphamk/alphamk.pdf for improvements).
William E. Byrd, Eric Holk & Daniel P. Friedman (2012):
miniKanren, live and untagged.
In: Proceedings of Scheme Workshop 12.
ACM.
Available at http://dx.doi.org/10.1145/2661103.2661105.
Hubert Comon (1994):
Constraints in Term Algebras (Short Survey).
In: Algebraic Methodology and Software Technology (AMAST'93).
Springer Science LNCS,
pp. 97–108.
Available at http://dx.doi.org/10.1007/978-1-4471-3227-1_9.
Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud & Claude Kirchner (1999):
A Methodological View of Constraint Solving.
Constraints 4(4),
pp. 337–361.
Available at http://dx.doi.org/10.1023/A:1009868906501.
Hubert Comon & Claude Kirchner (2001):
Constraint Solving on Terms.
In: Constraints in Computational Logics.
Springer Science LNCS,
pp. 47–103.
Available at http://dx.doi.org/10.1007/3-540-45406-3_2.
Jason Hemann, Daniel P. Friedman, William E. Byrd & Matthew Might (2016):
A small embedding of logic programming with a simple complete search.
In: Proceedings of DLS 16.
ACM.
Available at http://dx.doi.org/10.1145/2989225.2989230.
Serge Le Huitouze (1990):
A new data structure for implementing extensions to Prolog.
In: Programming Language Implementation and Logic Programming.
Springer Science LNCS,
pp. 136–150.
Available at http://dx.doi.org/10.1007/bfb0024181.
Joxan Jaffar, Michael Maher, Kim Marriott & Peter Stuckey (1998):
The semantics of constraint logic programs.
The Journal of Logic Programming 37(1-3),
pp. 1–46.
Available at http://dx.doi.org/10.1016/s0743-1066(98)10002-x.
Joxan Jaffar & Michael J. Maher (1994):
Constraint logic programming: a survey.
The Journal of Logic Programming 19-20,
pp. 503–581.
Available at http://dx.doi.org/10.1016/0743-1066(94)90033-7.
Joxan Jaffar, Michael J. Maher, Peter J. Stuckey & Roland H. C. Yap (1993):
Projecting CLP(R) constraints.
New Gener Comput 11(3-4),
pp. 449–469.
Available at http://dx.doi.org/10.1007/bf03037187.
Andrew W. Keep, Michael D. Adams, Lindsey Kuper, William E. Byrd & Daniel P. Friedman (2009):
A Pattern-matcher for miniKanren -or- How to Get into Trouble with CPS Macros.
In: Proceedings of Scheme Workshop 09, Cal Poly Technical Report CPSLO-CSC-09-03,
pp. 37–45.
Oleg Kiselyov, William E. Byrd, Daniel P. Friedman & Chung-chieh Shan:
Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl).
In: Functional and Logic Programming.
Springer Science LNCS,
pp. 64–80.
Available at http://dx.doi.org/10.1007/978-3-540-78969-7_7.
Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman & Amr Sabry (2005):
Backtracking, interleaving, and terminating monad transformers: (functional pearl).
In: Proceedings of ICFP 05 40.
ACM,
pp. 192–203.
Available at http://doi.acm.org/10.1145/1086365.1086390.
Ramana Kumar (2010):
Mechanising Aspects of miniKanren in HOL.
Australian National University. Bachelors thesis.
J. W. Lloyd & J. C. Shepherdson (1991):
Partial evaluation in logic programming.
The Journal of Logic Programming 11(3-4),
pp. 217–242.
Available at http://dx.doi.org/10.1016/0743-1066(91)90027-m.
Michael J. Maher (1993):
A Logic Programming View of CLP.
In: Proceedings of ICLP 93.
MIT Press,
pp. 737–753.
Joseph P. Near, William E. Byrd & Daniel P. Friedman (2008):
\voidb@x αleanT-.1667em-.1667emA-.1667emP: A Declarative Theorem Prover for First-Order Classical Logic.
In: Proceedings of ICLP 08,
pp. 238–252.
Available at http://dx.doi.org/10.1007/978-3-540-89982-2_26.
David Nolen (2016):
core.logic.
https://github.com/clojure/core.logic.
Tom Schrijvers, Peter Stuckey & Philip Wadler (2009):
Monadic constraint programming.
Journal of Functional Programming 19(06),
pp. 663.
Available at http://dx.doi.org/10.1017/s0956796809990086.