sqrt(2), so there is no least
element under the ≤ ordering. If only C types were required to
have a *total* ordering rather than a *well*-ordering; things would be
so much simpler.
-- Minimiscience
n. I can give you a
complete proof of this if you like.
-- Minimiscience
[1] <http://en.wikipedia.org/wiki/Ordered_field>
nclusion in intervals; if you want a list of values in an interval,
use ... instead.
-- Minimiscience
raised to
the zeroth power is one (except, arguably, zero itself), but, given a
number $num, its zeroth root is a number $base such that $base ** 0 ==
$num, which, as stated above, only makes sense when $num == 1.
-- Minimiscience
to NaN.
But the very next part of the sentence reads "[returns] itself if C<$n
== 0>". If root($x, 0) is supposed to return a list containing both
NaN and $x, the specification should probably be explicit. If it's
meant to only return NaN, the "itself if C<$n == 0>" part needs to be
deleted.
-- Minimiscience
true value"
definition for ^^ and xor would make Perl 6 inconsistent with itself.
I was going to say more in support of adding a separate operator for
"exactly one true value," but Darren Duncan beat me to it.
-- Minimiscience
e) could be problematic.
To summarize: either bring ^^ and xor with more than two operands in
line with the mathematical definition (possibly by just making them
left-associative and rewriting the descriptions to match), or stop
calling them "exclusive or."
-- Minimiscience
