compare NSPS/mine on other papers' benchmark functions (generating my own training data):
look for some new PBE paper with benchmark functions incorporating strong polymorphism without funky extras like recursion. this basically seems doubly unrealistic. :slightly_frowning_face:
settle for the benchmark functions of an existing paper, which may push me into adding recursion (#12), which I see as unnecessary added complexity for the purpose of my experiment and therefore if possible want to avoid Tamandu seems a viable candidate for! :slightly_smiling_face:
run other algorithms on a dataset of my choosing (designed to demonstrate the circumstances where I expect to add value). honestly though, comparing to type-only synthesizers may be unfair.
existing implementations (how hard will this be to integrate given for my own parts I've used Haskell?):
I can either:
may push me into adding recursion (#12), which I see as unnecessary added complexity for the purpose of my experiment and therefore if possible want to avoidTamandu seems a viable candidate for! :slightly_smiling_face:TODO: categorize existing papers based on whether they use types, examples, or both.