HaloO, Martin D Kealey wrote:
This solves both the human expectation ("Would you like wine or beer or juice?" "Beer and juice please" "Sorry...") and the associativity problem: (a ^^ b) ^^ (c ^^ d) == a ^^ (b ^^ (c ^^ d)).
I don't understand how the associativity problem is solved when we use unthrown exceptions to implement the one of n xor. The expression True && True && True is False without parens but (True && True) && True evaluates to True unless list associative operators somehow flatten the parens away and therefore see a single list of three values instead of two consecutive lists of two items. Regards, TSa. -- "The unavoidable price of reliability is simplicity" -- C.A.R. Hoare "Simplicity does not precede complexity, but follows it." -- A.J. Perlis 1 + 2 + 3 + 4 + ... = -1/12 -- Srinivasa Ramanujan