Child of #21
It's a bit much to execute and store literally every possible instantiation of a function with every combination of of arguments. Other solutions have used version space algebra or set notations and the like to reduce the number of concepts dealt with at any time.
Even though I'm avoiding intermediate representations, how can I better represent function input/output cases in my program to avoid the Gordian knot of program control I have now?
Child of #21
It's a bit much to execute and store literally every possible instantiation of a function with every combination of of arguments. Other solutions have used version space algebra or set notations and the like to reduce the number of concepts dealt with at any time.
Even though I'm avoiding intermediate representations, how can I better represent function input/output cases in my program to avoid the Gordian knot of program control I have now?