manasij7479

4 ms·

1. 1.▲
   by manasij7479 2y ago

   These are indeed neat papers!
2. 2.▲
   by manasij7479 3y ago

   Neat, I wonder if this idea could be developed into a more refined programming experience where you you spend time in the imperative world by default and only express some iterations as logic puzzles to be solved like this.
3. 3.▲
   by manasij7479 3y ago

   The issue you have circled around here is a bit deeper and nuanced than trimming down exponential code to something more tractable. In fact, it's often worse, and O(2^n) can be a blessing! The problem with logic programming is the &#x2
4. 4.▲
   by manasij7479 3y ago

   Input's and other side effects are not too tricky to handle. In most cases, you just slice the program to isolate pure computation, and just optimize that. Most traditional compiler optimizations stick to that as well, the exceptions t
5. 5.▲
   by manasij7479 3y ago

   The pruning part can do a lot of heavy lifting to make it a practical tool. Related: I work on Souper ( https://github.com/google/souper ). Feel free to reach out if anyone has questions!