Closed GoogleCodeExporter closed 9 years ago
Original comment by inkytonik
on 5 Nov 2009 at 5:21
From Randall Shulz:
One thing that might bear explaining is that while the "+" combinator is
nondeterministic choice when used alone, when used to supply the
argument to the conditional choice combinator, "<", it is simply a way
to convey the two conditionally applied strategies as the single
argument to <.
Original comment by inkytonik
on 5 Nov 2009 at 5:26
From Enrico Susatyo:
I thought I'd put this in my report, but then I decided just to ask you to be
sure. The documentation for
innermost strategy:
def innermost (s : => Strategy) : Strategy
Construct a strategy that applies s repeatedly to the innermost (i.e., lowest
and left-most) (sub-)term to
which it applies. Stop with the current term if s doesn't apply anywhere.
Isn't it supposed to be: Construct a strategy that applies s repeatedly to the
innermost (i.e., lowest and left-
most) (sub-)term to which it applies and work all the way up the tree.
Correct me if I'm wrong, but it seems from Visser's paper innermost used
bottomup which means it will not
only apply the strategy on the lowest and leftmost subterm, but also all the
way up.
Original comment by inkytonik
on 5 Nov 2009 at 5:27
Original comment by inkytonik
on 10 Nov 2009 at 5:09
Done (r4c6df19920)
Original comment by inkytonik
on 10 Nov 2009 at 5:45
Original comment by inkytonik
on 11 Nov 2009 at 2:34
Original issue reported on code.google.com by
inkytonik
on 5 Nov 2009 at 5:13