Date: Mon, 24 Nov 1997 17:27:56 +0100 (MET)
From: Jerome Vouillon <vouillon@clipper.ens.fr>
To: Francisco Valverde <fva@tsc.uc3m.es>
Subject: Re: Feature drawn back in new 1.06 version.
In-Reply-To: <34759E4C.1AE733A1@tsc.uc3m.es>
> I was using the possibity of defining recursive types for developing a
> rather convoluted search in two coupled domains, but now I find that I
> cannot anymore... Has anybody found a(n elegant, concise) way of
> circumventing it... Please note that the type recursion is ended by
> inserting appropriate non-recursive variants... Maybe I abused the type
> system! (Note also that a recursion at the level of structures would be
> heaven sent!)
> type p_state
[...]
> and p = (p_label, p_state, s) node
> and s = (s_label, s_state, p) node
You can change your type definitions as follow, and modify the
remaining of your program accordingly.
type p_state
[...]
and p = P of (p_label, p_state, s) node
and s = S of (s_label, s_state, p) node
-- Jerome
This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:13 MET