On Thu, Oct 25, 2012 at 3:27 PM, David Nolen <[email protected]> wrote:
> On Thu, Oct 25, 2012 at 3:10 PM, Jordan Lewis <[email protected]>wrote: > >> Hi, >> >> I'm new to core.logic and logic programming in general. I tried to write >> a small program to generate all permutations of any size for an input list >> with unique elements. To start, I hardcoded the input list to be (range 3). >> Here's what I came up with: >> > You can bound the q w/: (bounded-listo q n) n must be ground or you will continue to run into trouble. David -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to [email protected] Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/clojure?hl=en
