Yes, the work was done at Stanford (and Bill McKeeman did a lot of the systems
programming for the implementation).
The CACM article is a cleaned up version of this.
Cheers,
Alan
>________________________________
> From: Monty Zukowski <[email protected]>
>To: Fundamentals of New Computing <[email protected]>
>Sent: Wednesday, April 11, 2012 9:06 AM
>Subject: Re: [fonc] Kernel & Maru
>
>This one seems to be available as a technical report as well:
>
>http://infolab.stanford.edu/TR/CS-TR-65-20.html
>
>Monty
>
>On Wed, Apr 11, 2012 at 4:44 AM, Alan Kay <[email protected]> wrote:
>> One more that is fun (and one I learned a lot from when I was in grad school
>> in 1966) is Niklaus Wirth's "Euler" paper, published in two parts in CACM
>> Jan and Feb 1966.
>>
>> This is "a generalization of Algol" via some ideas of van Wijngaarten and
>> winds up with a very Lispish kind of language by virtue of consolidating and
>> merging specific features of Algol into a more general much smaller kernel.
>>
>> The fun of this paper is that Klaus presents a complete implementation that
>> includes a simple byte-code interpreter.
>>
>> This paper missed getting read enough historically (I think) because one
>> large part of it is a precedence parsing scheme invented by Wirth to allow a
>> mechanical transition between a BNF-like grammar and a parser. This part was
>> not very effective and it was very complicated.
>>
>> So just ignore this. You can use a Meta II type parser (or some modern PEG
>> parser like OMeta) to easily parse Euler directly into byte-codes.
>>
>> Everything else is really clear, including the use of the Dijkstra "display"
>> technique for quick access to the static nesting of contexts used by Algol
>> (and later by Scheme).
>>
>> Cheers,
>>
>> Alan
>>
>> ________________________________
>> From: Monty Zukowski <[email protected]>
>> To: Fundamentals of New Computing <[email protected]>
>> Sent: Tuesday, April 10, 2012 9:20 PM
>>
>> Subject: Re: [fonc] Kernel & Maru
>>
>> Thank you everyone for the great references. I've got some homework
>> to do now...
>>
>> Monty
>>
>> On Tue, Apr 10, 2012 at 2:54 PM, Ian Piumarta <[email protected]>
>> wrote:
>>> Extending Alan's comments...
>>>
>>> A small, well explained, and easily understandable example of an iterative
>>> implementation of a recursive language (Scheme) can be found in R. Kent
>>> Dybvig's Ph.D. thesis.
>>>
>>> http://www.cs.unm.edu/~williams/cs491/three-imp.pdf
>>>
>>> Regards,
>>> Ian
>>>
>>> _______________________________________________
>>> fonc mailing list
>>> [email protected]
>>> http://vpri.org/mailman/listinfo/fonc
>> _______________________________________________
>> fonc mailing list
>> [email protected]
>> http://vpri.org/mailman/listinfo/fonc
>>
>>
>>
>> _______________________________________________
>> fonc mailing list
>> [email protected]
>> http://vpri.org/mailman/listinfo/fonc
>>
>_______________________________________________
>fonc mailing list
>[email protected]
>http://vpri.org/mailman/listinfo/fonc
>
>
>
_______________________________________________
fonc mailing list
[email protected]
http://vpri.org/mailman/listinfo/fonc
