World: r4wp

(Seconded. If there is a link with Red, the link to Red is to prevent 
the same mistakes made again)

Brian, Maxim, the point of ALIAS is that it works with refinements. 
: : value assignments can't do that

The Chinese are going to take over the world, and they may well consider 
it an educational mistake to translate their Chinese R3 fork to English. 
To prevent having to learn Chinese, you could translate it back with 
ALIAS

The Chinese will have to take their world dominance from you first 
;)

They've already taken all my cousins in marriage...

Well, at least in tennis, currently the world dominance is here in 
Cz ;-)

Kaj, you can translate refinements using wrapper functions, and it's 
a better approach when you need to combine code from several nationalized 
sources. If you accept the idea of nationalized code, then you have 
to accept multi-nationalized code. This kind of thing is why I made 
sure R3 supported private modules.

That's an awful lot of wrapper functions, can't be done by a pure 
translator, and degrades performance

You'd still have to read Chinese to figure out what the code does

Right. As opposed to ALIAS, which can bring your system to a crashing 
halt, if you're lucky; if you're not lucky it will fail silently 
and stay a security hole.

With paren!, Fibonacci is now:

parameter: 40

fibonacci: func [n [integer!]] [
	either n < 2 [n] [(fibonacci n - 1) + fibonacci n - 2]
]

prin "Fibonacci "  prin parameter  prin ": "
print fibonacci parameter

To illustrate my point in a dumb way: alias 'true "false"

Yes, that's dumb enough that anyone would quickly figure out not 
to do that

Anyway, I increased the parameters of both Fibonacci and Mandelbrot 
to have a better benchmarking range for fast languages, such as Red/System

With this parameter and a more exact comparison, Red/System is 70 
times faster than Red

Red is 2.2 times faster than R3

Kaj, you are assuming that people don't want to create deliberate 
bugs. If any REBOL-like language with an interpreter of JIT becomes 
popular, we are going to have to assume that some developers will 
be malicious. Remember SQL-injection attacks. Don't add a feature 
that is only better than another way of doing that feature in that 
it is so trivially easy to use as an attack vector that anyone could 
use it with the stupidest code imaginable.

Programming is a security hole. If you want to allow people to do 
safe programming, you have to make it safe by disallowing many things. 
That would obviously include ALIAS

Also, REBOL-like languages are easy to generate from a dialect. A 
translator could write data files in a dialect, which could be used 
to generate the wrapper functions and assignment statements. And 
a half-way decent optimizer could get rid of the wrappers using the 
same methods that would allow it to statically resolve refinements. 
There's no reason to support an astoundly worse method.

I will happily allow people to use ALIAS on my Try REBOL server, 
just like I'm allowing most other REBOL features, because the server 
operating system is the party that establishes safe boundaries

astoundly -> astoundingly
Bad typing day.

You are welcome to try our server to see if you can break it with 
ALIAS

On my machine, REBOL catches up enormously when it can do many iterations 
in a very small loop. Apparently, a very small function will eventually 
fit in the CPU cache, so the VM gets less of a cache hit compared 
to compiled languages

With increased iterations, the effect is big in Fibonacci, but dramatic 
in Mandelbrot

Of course, most programs do not afford that advantage

I remember there being a spreadsheet expression evaluator that made 
it a point to have a small enough number of operations in its bytecode 
that it could fit two operations per byte. That means that with cache 
issues taken into account, its code was drastically faster than fully 
compiled code. The interpreter fit entirely in the instruction cache 
of a 486, and the bytecode was much smaller than regular native instructions, 
so the bytecode could be pushed into the CPU faster. This kind of 
a thing is even more of an issue now, with CPUs that are many times 
more faster than the memory busses, and even bigger caches.

On Mandelbrot with 50'000 iterations instead of the standard 1000, 
Red/System is 80 times faster than R3

R3 is obviously not designed with that kind of interpreter though, 
and isn't even bytecode compiled. That is more a trick for rebcode 
:)

GPU shader languages often use that trick though.

If anyone wants to help Red and thinks he can't start programming 
yet, please give it a presence here under Tested on RPi:

http://elinux.org/RPi_Programming

I have to wait to start programming my Raspberry Pi until I actually 
get it from Sinterklaas. After that I can try to test Red on it. 
I watched your presentation on programming in Red on the Raspberry 
Pi. No Syllable yet? WHat Linux did you use on the Rasp again Kaj?

Ah, so you volunteer for editing the wiki :-)

I said it in the video: Raspian, Arch Linux, and my preferred Bodhi 
Linux (based on Raspian)

Raspbian, that is

RISC OS runs best, though, but no Red

Syllable would have to be ported to ARM, which is a lot of work

Possible to port Red to RISC OS too? Or a lot of work too %Y\ ?

I could contribute to the wiki (which one are we talking about here?) 

Now I have my 10x10 checkers game in Version 1.0.0 released I have 
some time to spend on the script Doc asked for. Can the specifications 
be reposted please?

I have just uploaded a basic script to generate Red/System API docs 
to Github. It could do with a lot of polishing, perhaps you could 
take a look?

Red/System API Docs ... Just what I need, Thanks, Peter. :-)

I would like to report a bug in red-system. I would prefer not to 
register myself anywhere. Which is the simplest way ?

Arnold, I'm talking about the RPi wiki I linked above

Added to the favorites!

Marco, you can report it here, and someone will then re-post it in 
the bugtracker on github.

red-system question:
How can I create a simple array of constants?

That's a bit tricky. There's no explicit support for specifying that

You can write such a list in the arguments of a function, so you 
can make a constructor function that takes the constants and delivers 
the array

Actually, when you use a typed constructor function, you already 
get access to the arguments array, but it's an array of stuct!s of 
type typed-value!

If you can use the array in that form, you can use that trick, but 
you have to stay within the function because the array is on the 
stack