Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] Possibility of Nested Classes and Nested Inheritance?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jacques Garrigue <garrigue@m...>
Subject: Re: [Caml-list] Possibility of Nested Classes and Nested Inheritance?
From: Nate Nystrom <nystrom@cs.cornell.edu>

Thank you for your answer.
I'm happy to see you're interested in the functional view.

> From: Jacques Garrigue <garrigue@math.nagoya-u.ac.jp>
> > Answer 1: there are no inner classes in ocaml.
> 
> Another alternative is to use nested inheritance with modules.  This
> likely requires that module inheritance be added to the language,
> although there may be other approaches that fit in better with the ocaml
> module system.  In fact, we expect that in Jx (our extension of Java 
> with nested inheritance) package inheritance will be the main use of
> nested inheritance.

I'm not sure of what you mean by nested inheritance with modules.
But it wouldn't solve the problem in caml, as modules do not contain
implicit recursion: added definitions will not change the behaviour of
previous ones.
This is actually an advantage for reasoning about the code: scope is
static and ordered. But this makes inheritance of limited practical
use. (You have already flat inheritance with include.)

> > Answer 2: there are plenty of other ways to obtain similar effects.
> >
> > I don't know exactly what fascinated you in the paper, so it is hard
> > to answer precisely, but there are already a few techniques in ocaml to
> > solve the problems they describe.
> > (Of course they wouldn't cite them, as ocaml doesn't look like a
> > relevant language to them.)
> 
> I admit I was unaware of polymorphic variants.  I certainly would
> have cited ocaml had I been aware of them.

I hope I didn't offend you. It was just a generic remark about the
limited interest functional approaches enjoy in the object-oriented
community, even when they solve the same problem.

> > Their compiler example seems to be a variant of the expression
> > problem.
> 
> The expression problem is an instance of what we call scalable
> extensibility.

Indeed.

> > There are several solutions to the expression problem in ocaml, using
> > either polymorphic variants
> >   http://wwwfun.kurims.kyoto-u.ac.jp/~garrigue/papers/fose2000.html
> 
> I don't see how polymorphic variants solve the expression problem.
> As I understand them, if I were to implement a compiler using 
> polymorphic variants, I would create a variant for each term
> in the language, then write functions that match against those
> variants to implement the compiler passes.
> 
> However, if I want to add a new term to the language, I would
> have to add a new variant, then write new functions for each of
> the compiler passes to handle the new variant, delegating to the
> old functions for the old variants.  Thus if I have n passes
> implemented as functions, I have to write O(n) code to add a
> new term.  Please correct me if I'm wrong on this.
> Zenger and Odersky's ICFP'00 paper on extensible algebraic
> datatypes with defaults addresses this particular problem.
> 
> Furthermore, to allow extension, recursion is left open for
> the functions implementing the compiler passes and then closed
> in order to invoke the function on a particular type.  Thus, when a new 
> variant is added, a small amount of code for each open recursive
> function needs to be written to close the recursion with the new type.

You're right about the paper.
But this doesn't mean this does not solve the expression problem.
The expression problem is about the possibility of extension both by
adding new constructors and new operations. It is well known that
there are two types of solution for it: data-centered (or
object-oriented) and operation-centered (or functional decomposition).
By definition, the functional approach is operation-centered.
It means that adding a new constructor costs more than in the
data-centered approach, but adding a new operation costs less.
The cost of both is irrelevent to whether a solution is valid or not,
but if you want to compare you must consider the two kinds of
extensions.

By the way, if you just add a new construct in the language, it may
be better to simply go around modifying existing code, rather than
writing new delegation code, but this wouldn't solve the expression
problem.
Actually, I thought at first that this approach was too cumbersome to
be practical. But some people use it, and are satisfied with it.
And note that closing the recursion is in practice very light: you
just have to apply the pattern.

Another point, which John Skaller has just made, is that you can
perfectly define functions with default behaviours. I do it all the
time. The basic idea is to use a structural map or iter
function, which allows you to only code the non-standard cases.
This is dangerous, because your new constructors may actually require a
different handling. But the point here is that you can choose whether
you allow a default or not, and only have defaults when it is
reasonable to have them. So I would say that the functional approach
gives greater flexibility in your assumptions about future extensions.

> > or objects
> >   http://pauillac.inria.fr/~remy/work/expr/
> >
> > On the more general question of virtual types, Didier Rémy and Jérôme
> > Vouillon gave a detailed "refutation".
> >   http://pauillac.inria.fr/~remy/work/virtual/
> 
> This paper shows that you can use parametric polymorphism to solve the
> same problems virtual types were designed to address.  The problem to
> look out for with this approach is that you may end up parameterizing a
> class on a large number of related classes, e.g., parameterizing
> a compiler pass class on every AST node class (in our Java compiler,
> there are 40-50 such classes).  This paper argues that, in practice, you
> won't have too many parameters because you only need to parameterize on
> types on which there is actually a constraint.  I think this does not
> work with our compiler problem.  Using the traditional visitor pattern,
> you will have to parameterize the visitor class on every AST node class.

You should realize that you are not parameterizing with classes, but
with types. In practice you have only few types (or categories) of
nodes in an AST. In a functional language it would be 3: expressions,
patterns and types, with the previous not appearing inside the latter.
So it is reasonable to keep this kind of parameterization.

Cheers,

Jacques Garrigue