I am primarily a Python developer, so I am biased. But probably in the same direction as you.
Parrot is designed for a multilingual virtual machine. Its Perl roots sometimes show ("0" is false, the NQP bootstrap language is a subset of perl), but at runtime it's pretty linguistic-agnostic.
However, the interaction between languages ββwill not be completely smooth. For example, the String type is likely to be used as the base for all languages, but a Ruby object will probably require wrappers (but not proxies) for pythonic to work. There is no history for the interaction of objects, at least so far.
The Python 3 compiler "Pynie" has a great way. Here's the repo http://bitbucket.org/allison/pynie . Maybe you want to help? Now he is quite young, not even a lens.
And to answer your real question:
- Sorting. It is not fast, and the languages ββthat are aimed at it are not full, but it will not lead to a crash or damage to your memory.
- Usually you write code in your favorite high-level language (Python) and compile your .py code for parrots (and from there you can compile it to your own code if you want). Another developer can write their own Perl (6) code and compile it for parrots, and if the compilers were written taking into account the interaction, you can call the Perl function from python
Lucian
source share