From: Brian Rogoff <bpr@bpr.best.vwh.net>
To: William Harold Newman <william.newman@airmail.net>
Cc: caml-list@inria.fr
Subject: Re: [Caml-list] limits on mutual recursion and modules?
Date: Thu, 22 Nov 2001 04:27:24 +0000 (GMT) [thread overview]
Message-ID: <Pine.BSF.4.10.10111220358320.12326-100000@bpr.best.vwh.net> (raw)
In-Reply-To: <20011121195339.A24894@rootless>
On Wed, 21 Nov 2001, William Harold Newman wrote:
> I'm trying to understand the limits on mutual recursion in ML.
>
> I've seen the hack
> type 'a combination = T1 of int | T2 of 'a | T3 of 'a * 'a
> class virtual test =
> object
> method virtual get: test combination
> end
> for mutual recursion between classes and modules in OCaml. That doesn't
You mean between classes and types here, of course.
> leave me with much confidence that I can figure out whether a particular
> kind of mutual recursion is possible.:-|
>
> I've seen various statements about recursion between modules being
> impossible, but I'm not sure exactly how severe a limitation this is
> in practice, especially given the possibility of hacks like the one
> above.
That hack, which I've seen called the "parameterization trick" (we really
need a better, sexier sounding name for it) is the way you currently
create a recursion between a type definition and a functor instantiation.
> In particular, I'm curious whether it's possible to define
> a record type Foo which contains a functor-defined data structure which
> refer to objects of type Foo. E.g., in OCaml is there any way
> to define a record type Foo one of whose fields is a Set of Foo?
You use that same trick. It also means that you must make a polymorphic
version of Set to participate in the recursion; the library Set won't do.
Check this out
http://caml.inria.fr/archives/200010/msg00154.html
It's my guess that every frequent user of OCaml or SML bangs into this
within their first 9 months of serious ML programming, and most likely
long before that.
> In general, I'd be interested in any pointers to treatments of this
> problem and the theoretical limits involved.
http://cristal.inria.fr/~hirschow/index.html
as he is the one working on it and he has pointers to related work there.
-- Brian
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
next prev parent reply other threads:[~2001-11-22 15:52 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
2001-11-22 1:53 William Harold Newman
2001-11-22 4:27 ` Brian Rogoff [this message]
2001-11-22 4:40 ` William Harold Newman
2001-11-29 20:04 Tom Hirschowitz
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=Pine.BSF.4.10.10111220358320.12326-100000@bpr.best.vwh.net \
--to=bpr@bpr.best.vwh.net \
--cc=caml-list@inria.fr \
--cc=william.newman@airmail.net \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox