[Oberon] Soren Renner's concatenation-lang toy test cases ?

[Chris Glur]

Soren Renner, 
 I can't find your gmail-adr. Besides the recent post re. bad [too regular]
1st line of Base64 of rayTracing on Edgar's wiki got no reply.
==========

I've been chasing after 'mathementical/formal foundations of computing',
and reading about joy seems to suggest that something exists.

I've joined the 'concat..' mail-list today, and tried some familiarisation
test with toy.   But the "if" 'COMBINATOR OP' is giving me problems.

Here are some of my test results:--
>> [[1 2 3]  [4 5 6 7]  concat] ==  output: [   1   2  3   4   5   6  7 ]
>> [[1 2 3]  reverse] ] ==  output: [  3     2    1 ]
>> [ 4 5 equal ]  ==  output: F
>> [5 97 typeequal ]  == output: T
>> [5 7 swap pop ]  ==    output: 7
>> [ [5]  [3 6] cons ]  ==    output: [  [     3         6 ]         5 ]
>> [ [] empty  ]  ==  output:  T  [  ] 
>>  [ [5] [dup] 3 times] ==  output:  [    5 ]  [    5 ]  [    5 ]  [    5 ] 
>>  [ [5] [4] if ] ==  TRAP -14  NIL reference
>>  [ [5] [4] [3] if ] = TRAP 1  WITH guard failed
>>  [ [T] [4] [3] if ] =  TRAP 1  WITH guard failed
>>  [ [4] [3]  [T] if ] =  TRAP 1  WITH guard failed

Please provide a valid example to test the "if" COMBINATOR OP ?

Of course we are NOT looking for another language to do
"hello world, 2+3=5"; but if joy/toy can expose some of the 
'deeper theoretical aspects' of computing, I'd like to put it
on Egdars wiki.

Thanks,

== Chris Glur.