Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!umn-d-ub!cs.umn.edu!mike
From: mike@umn-cs.cs.umn.edu (Mike Haertel)
Newsgroups: comp.lang.misc
Subject: Re: Anyone want to design a language?
Message-ID: <1990Feb23.211123.17676@umn-cs.cs.umn.edu>
Date: 23 Feb 90 21:11:23 GMT
References: <390@argosy.UUCP> <14245@lambda.UUCP>
Distribution: usa
Organization: Free Software Foundation
Lines: 16

In article <14245@lambda.UUCP> jlg@lambda.UUCP (Jim Giles) writes:
>I)   Recursive data types.
  [...]
>              type b_tree is recursive
>                 node   value
>                 b_tree left
>                 b_tree right
>              end type b_tree

This is reasonable, even elegant.

My one question is:  How do you do mutually recursive data structures,
rather than just diretly recursive ones?
-- 
Mike Haertel <mike@ai.mit.edu>
"We are trying to support small memory machines." -- Larry McVoy