Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!samsung!zaphod.mps.ohio-state.edu!wuarchive!udel!new
From: new@udel.edu (Darren New)
Newsgroups: comp.lang.misc
Subject: Re: Anyone want to design a language?
Message-ID: <11911@nigel.udel.EDU>
Date: 22 Feb 90 23:48:29 GMT
References: <390@argosy.UUCP> <14245@lambda.UUCP>
Sender: usenet@udel.EDU
Reply-To: new@udel.edu (Darren New)
Distribution: usa
Organization: University of Delaware
Lines: 10

In article <14245@lambda.UUCP> jlg@lambda.UUCP (Jim Giles) writes:
>I)   Recursive data types.
>        As an example, consider a possible declaration of a binary tree
>        data type (all examples are in a Fortran/C-ish syntax - that is,
>              y = btree{3,x,btree{4,null,null}}

Ok.  Now how do I write the declaration of a function that returns 
a pointer to the first sub-tree with the value four at its root
without winding up with an aliased value?  AND how do I do this
without using recursion?          -- Darren