The uploaded file
Devel-TypeCheck-0.01.tar.gz
has entered CPAN as
file: $CPAN/authors/id/B/BA/BARGLE/Devel-TypeCheck-0.01.tar.gz
size: 17824 bytes
md5: 08c34f17ac3ba314a5e8e2a828e2b037
TypeCheck does basic type inference on Perl programs and reports if
types are used inconsistent
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
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?
Hi,
Yuval Kogman woobling.org> writes:
> On Thu, Aug 18, 2005 at 12:24:40 +, Ingo Blechschmidt wrote:
> > Yuval Kogman 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 code serialization
Hi list,
I tried to have a deeper look at Parrot so I installed latest PXPerl with
Parrot 0.2.3 and I tried to run some benchmarks on my computer in order to
compare with Neko.
I was thinking that Parrot JIT would outperform Neko VM easily but I got
theses results :
fib(35) Neko : 8 seconds
fib(
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 semanti
> On Fri, Aug 19, 2005 at 07:37:41PM +0200, Nicolas Cannasse wrote:
>> I released a few days ago the Neko intermediate language at
>> http://nekovm.org . In the FAQ I'm comparing Neko to LLVM / C-- and
Parrot.
>> According to a mail sent to me by Leopold Toetsch I got some points wrong
>> when tryi
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 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 t
