Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re: Re: What are the opportunities with Parrot?

by tjh (Curate)
on Aug 10, 2002 at 19:26 UTC ( #189221=note: print w/replies, xml ) Need Help??

in reply to Re: What are the opportunities with Parrot?
in thread What are the opportunities with Parrot?

Hmm. Sort of. I'm looking for what monks are thinking that they'll do with Parrot. What are they interested in doing with it; whether they think it brings them new possibilities and what those are.

The general idea of a VM is well understood, but of course, Perl has never had one, more or less. Are there any projects they'll now get to do in Perl? Is anyone thinking that Parrot somehow elevates Perl to a more mainstream enterprise platform (along with typing options, etc.) versus Java (for instance).

I'm thinking Parrot, along with Perl6, may be a bit groundbreaking, but I'm often quite naive and am looking for outside comments and ideas to help shape or stimulate my thinking.

  • Comment on Re: Re: What are the opportunities with Parrot?

Replies are listed 'Best First'.
Re: Re: Re: What are the opportunities with Parrot?
by jryan (Vicar) on Aug 11, 2002 at 04:28 UTC

    Leon Brocard put together a presentation about parrot; its worth taking a look at.

Re^3: What are the opportunities with Parrot?
by Aristotle (Chancellor) on Aug 11, 2002 at 04:46 UTC
    Actually, Perl5 already compiles code to execute in some form of VM, except it uses optrees rather than bytecode. But it is a set goal for the Parrot/Perl6 combo to achieve (IIRC) about twice the speed that Perl5 typically does.

    Makeshifts last the longest.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://189221]
[oiskuu]: Discipulus, from the edge or from the top?
[Discipulus]: oiskuu from the top aka 0-0 coords
[LanX]: edge or node?
[oiskuu]: from each height difference, there's a fixed number of "moves right" - "moves left". So it's a number of combinations.
[Discipulus]: I already know how much distinct paths exists but to demonstrate the property i want to have them all
[oiskuu]: ie C(n, k); where n is height difference, k is position in the line
[Discipulus]: infact there are 70 distinct path to reach the tale wich holds 70
[Discipulus]: what i want is to compute them

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (10)
As of 2018-03-19 11:03 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.