On Fri, Aug 19, 2005 at 21:29:11 -0700, Larry Wall wrote:
Basically, unaries don't have to worry about reconciling different shapes.
They just recurse as much as is reasonable, whatever that is.
Possible exact semantics of reasonable:
hyper recurses at least one level, and then tries
On Thu, 09 Jan 2003 21:12:07 -0500, John Siracusa
[EMAIL PROTECTED] wrote:
[...]
Hey, it adds up! Okay, maybe it doesn't...but still, Perl 6 Should Be Able
To Do This! :) And I'd also like inline constructs like:
ASSERT $foo 5 is_happy(blah);
macro debug ($code) is parsed
On Sat, Aug 20, 2005 at 12:27:23PM +0300, Yuval Kogman wrote:
: On Fri, Aug 19, 2005 at 21:29:11 -0700, Larry Wall wrote:
:
: Basically, unaries don't have to worry about reconciling different shapes.
: They just recurse as much as is reasonable, whatever that is.
:
: Possible exact semantics
Hi,
Yuval Kogman nothingmuch at woobling.org writes:
On Thu, Aug 18, 2005 at 12:24:40 +, Ingo Blechschmidt wrote:
Yuval Kogman nothingmuch at woobling.org writes:
So now that the skeptics can see why this is important, on the
design side I'd like to ask for ideas on how the
Hi,
S02 says:
our $a; say $::(a); # works
my $a; say $::(a); # dies, you should use:
my $a; say $::(MY::a); # works
How can I use symbolic dereferentiation to get $?SELF, $?CLASS,
::?CLASS, %MY::, etc.?
say $::('$?SELF');# does this work?
say
On Sat, Aug 20, 2005 at 22:27:56 +, Ingo Blechschmidt wrote:
Not code, but the return value of code.emit
Hm, Str? Or possibly a subtype of Str, allowing:
I would guess an AST, that is, any object, that implements
stringification.
the AST could just be the same PIL reblessed with some
