Searching-In-An-Infinite-Space-Prolog VS core.logic

This brings up memories from 7 years ago. While in Uni, we had a homework: "Searching in an infinite space using Prolog".

Unfortunately, the comments are in my native language, but the assignment was to search for a box in an infinite space and bring it back to (0, 0).

It was fun: https://github.com/mateioprea/Searching-In-An-Infinite-Space...

It's also available in Clojure: https://github.com/clojure/core.logic

If you want to write one yourself, it's pretty easy: https://www.youtube.com/watch?v=y1bVJOAfhKY

Something like Clojure's core.logic would be pretty nice too. As I understand it, this is one of those features that has been re-invented time and again in the Lisp world over the years. Although the CL standard is already fairly large, it would probably be a bit controversial to make that a required part of a CL implementation. Still, it would be cool to have the option of using dependent types in the macro system to generate formerly verified Lisp code at compile time.

It also has core.logic which is minikanren. There are other logic programming options as well. Some libraries like core.typed use core.logic for the type checker.

You could study core.logic: https://github.com/clojure/core.logic/tree/master/src/main/c...

I swear I'd bookmarked a resource that was more analogous to #2, but you may want to have a look at The Little Prover: https://mitpress.mit.edu/books/little-prover

related:

https://github.com/clojure/core.logic/wiki/A-Core.logic-Prim...