-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]]
Sent: Thursday, November 25, 1999 4:38 PM
To: [EMAIL PROTECTED]
Subject: [REBOL] 2.2 preliminary docs???
http://www.rebol.com/manual/
BTW: Would it be possible for the Rebol team to create an archive Rebol or
In article 000901bf37e4$3bfc39c0$732de195@SW1DEV,
[EMAIL PROTECTED] writes
BTW: Would it be possible for the Rebol team to create an archive Rebol or
ZIP and provide it for downloading? There are some people here having to
pay while they are connected... Robert
You could spider that directory
hello,
I just discovered Rebol last week and have become a little obsessed with its
simple beauty. Hence I want to re-write all my perl scripts and bin it for
good.
I've been desperately tring to get rebol cgi support set up on my macintosh
and a linux box. To no avail. I've never had to
Hi everyone!
I'm probablyway to late with this post, since I don't have daily internet
access anymore, nor daily Rebol exposure, it's great to see the list so
alive! All those new users, even from India, hurrah!
But anyway, on to the problem:
William wrote:
My username is
[EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
...
You should be able to find the messages on rebol.org; the subject
was "Context" or perhaps "REBOL contexts"...
BTW, I'm sorry I didn't have the time to dig back those messages
in the last days. Most of them are in the first thread
[EMAIL PROTECTED] wrote:
I've been thinking some more about dialects this afternoon - so I
thought it best to keep on this topic... ^_^ :-)
[...]
It's very similar to what I did when I started to implement a
dialect to send control sequences to ViNCEd terminal (on the
Amiga); I never finished
Elan said:
I think Jeff's example (subject: [REBOL] Functional
programming in REBOL Re:):
use [pod][
do pod: func [x][
any [all [zero? x 1]
all [odd? x x * pod x - 1] pod x - 1]
] 20
]
which, when executed
Hi, Rebols!
tried this:
trial: func [par] [
do func [/local p] [
p: par
make object! [
prt: func
[] [print p]
]
]
]
trial2: func [par /local p] [
p: par
make object! [
prt: func [] [print p]
]
]
with the following results:
a: trial 1
a/prt
1
b: trial 2
b/prt
2
a/prt
1
c:
Hi John,
REBOL gets a stack overflow, yet the obvious
`imperative' version of the program produces the correct answer.
If you consider a data set of `dozens' or `hundreds' of elements
to be the limits of `reasonable', then, yes, REBOL does just fine.
I routinely use datasets of `thousands' or
Was it Ingo who mentioned that tail recursion had been removed from the
current REBOL implementation and asked when it would be returned? That
should take care of the stack overflow problem. The problem is a result of
an incomplete implementation of REBOL (missing tail recursion) and I don't
Hi Ladislav,
At 06:32 PM 11/26/99 +0100, you wrote:
Hi, Rebols! tried this: trial: func [par] [ do func [/local p] [
p: par make object! [ prt: func [] [print p]
] ] ] trial2: func [par /local p] [ p: par make
object! [
Elan,
THX for explanation. Sorry for the inconvenience, I didn't use my computer
to send the last e-mail.
Ladislav
John,
I don't know what functional code is. However the following example shows
the calculation of the product of successive odd numbers for quite a range.
What kind of code is it?
Jerry
source test
test: func [n /local x z][
x: array 0
for i 1 n 1 [insert x 2 * i + 1]
z: 1
[EMAIL PROTECTED] wrote:
I have a small script named t04.r with a header like:
REBOL [ Title: " test " Author: " ww " ]
this is loaded with
do %t04.r
or
do load %t04.r
I have tried to access the header fields with many variations of
Title
mold
Hi Andrew,
I had written:
Which part surprises you?
to which you replied
That Interface/Test returns the value of 't! In C++, this wouldn't
work, as the function 'Test_Implementation wouldn't be able to find 't
in 'Interface. It's disturbing to me as a C++ programmer, but viewing
it as a
I am considering writing an app that would create several hundred or
a few thousand copies of a single object. One way to keep track of them
is to use an array. A script that tests this syntax is below along with
a run which does a "print mold" on the array. It appears that the
My understanding was that tail recursion ( or its optimized implementation )
gives a (properly written) recursive program the efficiency of an
iterative program. Thus it is a very desirable capability to build
into a language which is intended to use a lot of recursive
program structures.
17 matches
Mail list logo