On Mon, 26 Jun 2006, David Feuer wrote:

> On 6/26/06, Andre van Tonder <xxxxxx@now.het.brown.edu> wrote:
>
>> I like the operational semantics in the SRFI, since it may be less
>> ambiguous
>> than the alternative declarative approach.
>
> I think the trick is to make an unambiguous declarative specification.

That is not an easy trick...  I'm not saying it is impossible, but
conceivably the most reliable description of what this algorithm achieves may
be the statement of the algorithm itself.

If the specification does keep the operational approach, it
would be nice, in my view, if the Waddell algebra could be updated for R6RS and
included as part of the specification.

Regards
Andre