UNCOL Problem (maybe) resolved.

classic Classic list List threaded Threaded
3 messages Options
Reply | Threaded
Open this post in threaded view
|

UNCOL Problem (maybe) resolved.

Thomas.Schneider.Wien
When studying Technical Mathematics, here, at the Technical University
In Vienna,
I have been teached about the UNCOL (Universal Compiler) problem.

It has been depicted as beeing UN-Feasable, at those time (1963).

ReyC, the Rey Compiler, will be a PROOVE that it is feasable.

But, some work has still to be done.

Greetings, from dark Vienna,

Tom.

_______________________________________________
Ibm-netrexx mailing list
[hidden email]

Tom. (ths@db-123.com)
Reply | Threaded
Open this post in threaded view
|

RE: UNCOL Problem (maybe) resolved.

Mike Cowlishaw
 
> When studying Technical Mathematics, here, at the Technical
> University In Vienna, I learned about the UNCOL
> (Universal Compiler) problem.

Many would argue that this problem has been solved many times already.  A
few examples (most recent first):

 -- Java

 -- IL: the intermediate language used by the 801 compiler group for PL.8,
which then became used for all compiler front- and back-ends in IBM, for C,
PL/I, PL.8, etc., etc.  Many other compilers do something similar.

 -- P-code: first used for UCSD Pascal (and O-code before that, although
the latter was for one language only)

 -- IBM S/360: the first 360 machines all used different underlying
architectures, but they all interpreted the same higher-level machine code;
effectively IBM 360 machine language was a bytecode, like Java.  It wasn't
until quite a bit later that 'native' 360 machines were built (the model
95, I think)

Mike

_______________________________________________
Ibm-netrexx mailing list
[hidden email]

Reply | Threaded
Open this post in threaded view
|

Re: UNCOL Problem (maybe) resolved.

Thomas.Schneider.Wien
Not to mention NetRexx, which had the same approach in your original
Design, as far as I can remember from our first personal talks there in
the US at the REXXLA meeting (in Burlington?, cannot remember the
place).... :-)

Thanks for your update(s) of  my  knowledge anyway :-)

Have a nice sunday!

Cheers, Tom.
==================================================================================

Mike Cowlishaw schrieb:

>  
>  
>> When studying Technical Mathematics, here, at the Technical
>> University In Vienna, I learned about the UNCOL
>> (Universal Compiler) problem.
>>    
>
> Many would argue that this problem has been solved many times already.  A
> few examples (most recent first):
>
>  -- Java
>
>  -- IL: the intermediate language used by the 801 compiler group for PL.8,
> which then became used for all compiler front- and back-ends in IBM, for C,
> PL/I, PL.8, etc., etc.  Many other compilers do something similar.
>
>  -- P-code: first used for UCSD Pascal (and O-code before that, although
> the latter was for one language only)
>
>  -- IBM S/360: the first 360 machines all used different underlying
> architectures, but they all interpreted the same higher-level machine code;
> effectively IBM 360 machine language was a bytecode, like Java.  It wasn't
> until quite a bit later that 'native' 360 machines were built (the model
> 95, I think)
>
> Mike
>
> _______________________________________________
> Ibm-netrexx mailing list
> [hidden email]
>
>
>  

_______________________________________________
Ibm-netrexx mailing list
[hidden email]

Tom. (ths@db-123.com)