4 ms·

This sounds really interesting. I'm very happy you shared it. I'd love to see it when you publish it. Based on your description it seems like a lot of code, so

• carapace 7y ago
  Cheers! The project is here: http://joypy.osdn.io/ http://joypy.osdn.io/ FWIW. The Prolog code is under the ./thun subdir. I apologize for the state of the repo & docs. I need to go through and update everything. If you look at the Python code the vast majority of it is the type inference module and the library of functions and combinators. The parser, main loop, and most of the library are trivial. Most of the joy.utils.types module is a crude re-implementation of a subset of Prolog and can be discarded. The Prolog version of Joy is even shorter than the Python version. The Joy compiler (which is only about half done) is really tight and simple (Joy doesn't use variable so no need for a symbol table; Joy doesn't use subroutines so no need for a call stack) and the last half of the functionality won't require double the code. Meta-programming in both Joy and Prolog is really easy and powerful, and Joy in particular lends itself to a kind of Huffman encoding of your graph (Joy code forms a simple DAG.) - - - - I want to repeat, Mu is really inspiring. I'm looking forward to watching your progress. :-)