Hi everybody,
I have posted some more (incomplete for now) stack algebra results, as
well as a detailed description of an actual stack effect inference
algorithm that works with recursive words at
http://www.jroller.com/page/slava/.
The code can be found in CVS:
http://cvs.sourceforge.net/viewcvs.py/factor/Factor/Factor/library/tools/inference.factor?view=markup
It is reasonably complete, however it has some limitations:
- While simple recursive words can have their stack effects inferred,
recursive combinators (like each, map, and so on) do not.
- Only a small set of primitives has their stack effects specified.
Neither of these is unfixable, and the next iteration of the code will
solve them.
The next steps I want to take with this is proving the two conjectures
about generalized recursive stack effects, finishing the inference
algorithm, then extending the model to infer types.
Slava