Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ima.UUCP
Path: utzoo!decvax!ima!johnl
From: johnl@ima.UUCP (Compilers mailing list)
Newsgroups: mod.compilers
Subject: recursive declarations
Message-ID: <133@ima.UUCP>
Date: Tue, 17-Jun-86 11:00:15 EDT
Article-I.D.: ima.133
Posted: Tue Jun 17 11:00:15 1986
Date-Received: Thu, 19-Jun-86 00:20:44 EDT
Lines: 19
Approved: <compilers@ima.UUCP>
Really-from: think!caip!ll-xn!caip!uw-beaver!fluke!kurt
Posted-Date: Fri, 13 Jun 86 15:59:34 pdt

I saw an article in SIGPLAN NOTICES a few months ago about using
recursive data declarations and getting rid of explicit pointer
operations in programming languages.  I didn't have much luck
understanding the mechanics of this (I am not sure the author
really did either).  Is there somebody who understands this stuff
and knows if it works or not?

I am also interested in optimization, and specifically in knowing
if there is some reference that lists the language features that
make various optimizations impossible or difficult.  Anyone know
of such a beast?  Such a list would make it easier to consider the
value/danger/cost of putting feature X into a new programming
language.
-- 
Send compilers mail to ima!compilers or, in a pinch to Levine@YALE.EDU
Plausible paths are { ihnp4 | decvax | cbosgd | harvard | yale | bbncca}!ima

Please send responses to the originator of the message -- I cannot forward
mail accidentally sent back to compilers.  Meta-mail to ima!compilers-request