Closed GoogleCodeExporter closed 9 years ago
Perhaps recursive call search should not use the same unification machinery as
normal equations. Rather, |seekIn| could accumulate a list of fresh references,
then the matching code could solve for those references (only). That would
ensure we match all user-visible programming problem arguments as expected. We
could potentially hope for missing references, in case the recursive call
justification required some extra arguments (e.g. proofs) not present in the
programming problem.
Original comment by adamgundry
on 3 Sep 2010 at 3:43
I have pushed a quick hack to higherMatch that ensures the values in the
substitution it generates are fully applied. My plan is to review and refactor
the recursive call search and matching code, so this is more principled and
robust.
http://www.e-pig.org/darcsweb/darcsweb?r=Pig09;a=commit;h=20100906114428-e29d1-9
a6aa6dd0283cad36727f5a8f681c986506355fc.gz
Original comment by adamgundry
on 6 Sep 2010 at 11:58
My new version has now been committed, and seems to handle all the test cases.
There are a few outstanding issues which I need to address, but they are
documented in the source and should not arise in normal use, so I am closing
this bug. Feel free to open another if matching fails for your favourite
recursive call.
http://www.e-pig.org/darcsweb/darcsweb?r=Pig09;a=commit;h=20100907122415-e29d1-d
d02f291c265fb47af7ec8759bfa04a470e051bc.gz
Original comment by adamgundry
on 8 Sep 2010 at 8:12
Original issue reported on code.google.com by
pedag...@gmail.com
on 1 Sep 2010 at 3:24